./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 17:57:11,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 17:57:11,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 17:57:11,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 17:57:11,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 17:57:11,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 17:57:11,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 17:57:11,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 17:57:11,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 17:57:11,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 17:57:11,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 17:57:11,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 17:57:11,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 17:57:11,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 17:57:11,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 17:57:11,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 17:57:11,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 17:57:11,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 17:57:11,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 17:57:11,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 17:57:11,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 17:57:11,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 17:57:11,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 17:57:11,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 17:57:11,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 17:57:11,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 17:57:11,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 17:57:11,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 17:57:11,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 17:57:11,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 17:57:11,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 17:57:11,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 17:57:11,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 17:57:11,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 17:57:11,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 17:57:11,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 17:57:11,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 17:57:11,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 17:57:11,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 17:57:11,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 17:57:11,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 17:57:11,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 17:57:11,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 17:57:11,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 17:57:11,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 17:57:11,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 17:57:11,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 17:57:11,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 17:57:11,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 17:57:11,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 17:57:11,792 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 17:57:11,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 17:57:11,793 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 17:57:11,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 17:57:11,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 17:57:11,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 17:57:11,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 17:57:11,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 17:57:11,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 17:57:11,795 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 17:57:11,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 17:57:11,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 17:57:11,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 17:57:11,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 17:57:11,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 17:57:11,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 17:57:11,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:57:11,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 17:57:11,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 17:57:11,798 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 17:57:11,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 17:57:11,798 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 17:57:11,798 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 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-08-30 17:57:12,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 17:57:12,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 17:57:12,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 17:57:12,121 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 17:57:12,121 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 17:57:12,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-30 17:57:13,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 17:57:13,537 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 17:57:13,538 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-30 17:57:13,562 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac727883f/f2a144b6c78645d5aaef656d6b3ba09b/FLAGd0b645209 [2023-08-30 17:57:13,590 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac727883f/f2a144b6c78645d5aaef656d6b3ba09b [2023-08-30 17:57:13,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 17:57:13,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 17:57:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 17:57:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 17:57:13,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 17:57:13,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:57:13" (1/1) ... [2023-08-30 17:57:13,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7081ac5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:13, skipping insertion in model container [2023-08-30 17:57:13,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:57:13" (1/1) ... [2023-08-30 17:57:13,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 17:57:13,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 17:57:14,073 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-08-30 17:57:14,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:57:14,122 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 17:57:14,187 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2023-08-30 17:57:14,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:57:14,265 INFO L208 MainTranslator]: Completed translation [2023-08-30 17:57:14,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14 WrapperNode [2023-08-30 17:57:14,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 17:57:14,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 17:57:14,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 17:57:14,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 17:57:14,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,321 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-08-30 17:57:14,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 17:57:14,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 17:57:14,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 17:57:14,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 17:57:14,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,352 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 17:57:14,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 17:57:14,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 17:57:14,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 17:57:14,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (1/1) ... [2023-08-30 17:57:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:57:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:14,394 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-08-30 17:57:14,408 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-08-30 17:57:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 17:57:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 17:57:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 17:57:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 17:57:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 17:57:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 17:57:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 17:57:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 17:57:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 17:57:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 17:57:14,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 17:57:14,427 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 17:57:14,597 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 17:57:14,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 17:57:14,986 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 17:57:14,994 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 17:57:14,997 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-30 17:57:15,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:57:15 BoogieIcfgContainer [2023-08-30 17:57:15,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 17:57:15,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 17:57:15,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 17:57:15,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 17:57:15,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:57:13" (1/3) ... [2023-08-30 17:57:15,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b228f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:57:15, skipping insertion in model container [2023-08-30 17:57:15,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:14" (2/3) ... [2023-08-30 17:57:15,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b228f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:57:15, skipping insertion in model container [2023-08-30 17:57:15,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:57:15" (3/3) ... [2023-08-30 17:57:15,009 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-08-30 17:57:15,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 17:57:15,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 17:57:15,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-30 17:57:15,026 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 17:57:15,095 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 17:57:15,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 17:57:15,292 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-08-30 17:57:15,293 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 17:57:15,303 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-08-30 17:57:15,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 17:57:15,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:15,321 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:57:15,333 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:15,340 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:15,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:15,403 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-08-30 17:57:15,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:15,408 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-08-30 17:57:15,418 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-08-30 17:57:18,074 INFO L134 LiptonReduction]: Checked pairs total: 28650 [2023-08-30 17:57:18,074 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-08-30 17:57:18,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:57:18,093 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=true, 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;@2d275b48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:57:18,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 17:57:18,099 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2023-08-30 17:57:18,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:18,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:18,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:18,101 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-08-30 17:57:18,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash -454048497, now seen corresponding path program 1 times [2023-08-30 17:57:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762127626] [2023-08-30 17:57:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:57:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762127626] [2023-08-30 17:57:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762127626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:57:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:57:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633931986] [2023-08-30 17:57:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:57:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:57:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:57:18,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-30 17:57:18,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:18,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:18,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-30 17:57:18,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:18,696 INFO L130 PetriNetUnfolder]: 579/1212 cut-off events. [2023-08-30 17:57:18,696 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:18,698 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-08-30 17:57:18,703 INFO L137 encePairwiseOnDemand]: 396/430 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 17:57:18,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-30 17:57:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:57:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:57:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-08-30 17:57:18,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286821705426357 [2023-08-30 17:57:18,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-08-30 17:57:18,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-08-30 17:57:18,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:18,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-08-30 17:57:18,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:18,743 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-08-30 17:57:18,744 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-08-30 17:57:18,746 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 682 transitions. [2023-08-30 17:57:18,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-30 17:57:18,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:57:18,752 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-08-30 17:57:18,754 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-08-30 17:57:18,759 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-30 17:57:18,759 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-08-30 17:57:18,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:18,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:18,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 17:57:18,761 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-08-30 17:57:18,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 573264157, now seen corresponding path program 1 times [2023-08-30 17:57:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826442566] [2023-08-30 17:57:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:57:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826442566] [2023-08-30 17:57:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826442566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:18,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:57:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 17:57:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406759002] [2023-08-30 17:57:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:18,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:57:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:57:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:57:18,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-30 17:57:18,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:18,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:18,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-30 17:57:18,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:19,041 INFO L130 PetriNetUnfolder]: 547/1178 cut-off events. [2023-08-30 17:57:19,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:19,043 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-08-30 17:57:19,047 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 17:57:19,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-08-30 17:57:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:57:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:57:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2023-08-30 17:57:19,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170542635658915 [2023-08-30 17:57:19,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2023-08-30 17:57:19,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2023-08-30 17:57:19,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:19,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2023-08-30 17:57:19,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:19,054 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-08-30 17:57:19,055 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-08-30 17:57:19,055 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 147 flow. Second operand 3 states and 667 transitions. [2023-08-30 17:57:19,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-08-30 17:57:19,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:57:19,059 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-08-30 17:57:19,060 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-08-30 17:57:19,060 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-08-30 17:57:19,060 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-08-30 17:57:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:19,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:19,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:19,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 17:57:19,062 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-08-30 17:57:19,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -646993721, now seen corresponding path program 1 times [2023-08-30 17:57:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:19,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165293252] [2023-08-30 17:57:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:57:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165293252] [2023-08-30 17:57:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165293252] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819087659] [2023-08-30 17:57:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:19,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:19,141 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-08-30 17:57:19,173 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-08-30 17:57:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:19,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:57:19,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:57:19,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:57:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819087659] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:19,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:57:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839865879] [2023-08-30 17:57:19,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:19,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:57:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:57:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:57:19,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-30 17:57:19,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:19,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:19,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-30 17:57:19,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:19,579 INFO L130 PetriNetUnfolder]: 576/1192 cut-off events. [2023-08-30 17:57:19,580 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-30 17:57:19,582 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-08-30 17:57:19,586 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-30 17:57:19,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-08-30 17:57:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:57:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:57:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1247 transitions. [2023-08-30 17:57:19,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-30 17:57:19,590 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1247 transitions. [2023-08-30 17:57:19,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1247 transitions. [2023-08-30 17:57:19,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:19,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1247 transitions. [2023-08-30 17:57:19,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:19,598 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-08-30 17:57:19,600 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-08-30 17:57:19,600 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 151 flow. Second operand 6 states and 1247 transitions. [2023-08-30 17:57:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-08-30 17:57:19,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 17:57:19,603 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-08-30 17:57:19,603 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-08-30 17:57:19,604 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-08-30 17:57:19,604 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-08-30 17:57:19,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:19,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:19,605 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:19,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 17:57:19,817 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-08-30 17:57:19,818 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-08-30 17:57:19,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash -254815792, now seen corresponding path program 2 times [2023-08-30 17:57:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231738178] [2023-08-30 17:57:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:57:19,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231738178] [2023-08-30 17:57:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231738178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936325644] [2023-08-30 17:57:19,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:57:19,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:19,925 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-08-30 17:57:19,927 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-08-30 17:57:20,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:57:20,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:57:20,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 17:57:20,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:20,049 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-08-30 17:57:20,122 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:57:20,123 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-08-30 17:57:20,154 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-08-30 17:57:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 17:57:20,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:57:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936325644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:57:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:57:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377575964] [2023-08-30 17:57:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:20,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:57:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:57:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:57:20,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 430 [2023-08-30 17:57:20,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:20,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:20,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 430 [2023-08-30 17:57:20,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:20,723 INFO L130 PetriNetUnfolder]: 814/1702 cut-off events. [2023-08-30 17:57:20,723 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 17:57:20,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1702 events. 814/1702 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10255 event pairs, 106 based on Foata normal form. 0/1427 useless extension candidates. Maximal degree in co-relation 3266. Up to 1029 conditions per place. [2023-08-30 17:57:20,731 INFO L137 encePairwiseOnDemand]: 422/430 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2023-08-30 17:57:20,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 529 flow [2023-08-30 17:57:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 17:57:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 17:57:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1052 transitions. [2023-08-30 17:57:20,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48930232558139536 [2023-08-30 17:57:20,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1052 transitions. [2023-08-30 17:57:20,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1052 transitions. [2023-08-30 17:57:20,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:20,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1052 transitions. [2023-08-30 17:57:20,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:20,740 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-08-30 17:57:20,741 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-08-30 17:57:20,741 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 183 flow. Second operand 5 states and 1052 transitions. [2023-08-30 17:57:20,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 529 flow [2023-08-30 17:57:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 515 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:57:20,745 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-08-30 17:57:20,745 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-08-30 17:57:20,745 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-08-30 17:57:20,746 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-08-30 17:57:20,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:20,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:20,747 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:20,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 17:57:20,953 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-08-30 17:57:20,954 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-08-30 17:57:20,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1650306531, now seen corresponding path program 1 times [2023-08-30 17:57:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120007077] [2023-08-30 17:57:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 17:57:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120007077] [2023-08-30 17:57:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120007077] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000454335] [2023-08-30 17:57:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:21,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:21,024 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-08-30 17:57:21,047 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-08-30 17:57:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:21,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:57:21,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:57:21,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:57:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000454335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:21,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 17:57:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562834838] [2023-08-30 17:57:21,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 17:57:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 17:57:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 17:57:21,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 430 [2023-08-30 17:57:21,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 219 flow. Second operand has 14 states, 14 states have (on average 196.92857142857142) internal successors, (2757), 14 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:21,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:21,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 430 [2023-08-30 17:57:21,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:21,344 INFO L130 PetriNetUnfolder]: 61/186 cut-off events. [2023-08-30 17:57:21,344 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 17:57:21,345 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-08-30 17:57:21,346 INFO L137 encePairwiseOnDemand]: 425/430 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-08-30 17:57:21,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-08-30 17:57:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 17:57:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 17:57:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2786 transitions. [2023-08-30 17:57:21,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627906976744186 [2023-08-30 17:57:21,353 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2786 transitions. [2023-08-30 17:57:21,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2786 transitions. [2023-08-30 17:57:21,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:21,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2786 transitions. [2023-08-30 17:57:21,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 199.0) internal successors, (2786), 14 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:21,368 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-08-30 17:57:21,370 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-08-30 17:57:21,370 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 219 flow. Second operand 14 states and 2786 transitions. [2023-08-30 17:57:21,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-08-30 17:57:21,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 17:57:21,373 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-08-30 17:57:21,374 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-08-30 17:57:21,374 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-08-30 17:57:21,375 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-08-30 17:57:21,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 196.92857142857142) internal successors, (2757), 14 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:57:21,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:21,376 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-08-30 17:57:21,388 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-08-30 17:57:21,588 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-08-30 17:57:21,588 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-08-30 17:57:21,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash -630653115, now seen corresponding path program 1 times [2023-08-30 17:57:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536984801] [2023-08-30 17:57:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:57:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536984801] [2023-08-30 17:57:22,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536984801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009167496] [2023-08-30 17:57:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:22,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:22,593 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-08-30 17:57:22,596 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-08-30 17:57:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:22,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 17:57:22,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:22,699 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-08-30 17:57:22,786 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:57:22,786 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-08-30 17:57:22,815 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-08-30 17:57:22,916 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-08-30 17:57:22,989 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-08-30 17:57:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:57:23,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:31,149 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-08-30 17:57:33,156 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-08-30 17:57:35,188 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-08-30 17:57:43,266 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-08-30 17:57:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:57:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009167496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:43,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-30 17:57:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140784594] [2023-08-30 17:57:43,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:43,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 17:57:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 17:57:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=6, NotChecked=164, Total=600 [2023-08-30 17:57:43,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 430 [2023-08-30 17:57:43,527 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-08-30 17:57:43,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:43,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 430 [2023-08-30 17:57:43,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:49,818 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-08-30 17:57:55,878 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-08-30 17:58:15,999 WARN L222 SmtUtils]: Spent 20.05s 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-08-30 17:58:18,054 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-08-30 17:58:20,061 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-08-30 17:58:22,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-08-30 17:58:24,070 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-08-30 17:58:26,085 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-08-30 17:58:28,092 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-08-30 17:58:30,097 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-08-30 17:58:32,106 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-08-30 17:58:34,109 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-08-30 17:58:36,116 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-08-30 17:58:38,124 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-08-30 17:58:39,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 17:58:41,785 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 [1] [2023-08-30 17:58:43,787 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-08-30 17:58:46,581 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-08-30 17:58:48,590 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-08-30 17:58:50,593 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-08-30 17:58:52,596 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-08-30 17:58:54,621 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-08-30 17:58:56,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 17:58:58,639 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-08-30 17:59:00,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 17:59:02,645 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-08-30 17:59:04,650 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-08-30 17:59:12,886 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-08-30 17:59:12,972 INFO L130 PetriNetUnfolder]: 60/193 cut-off events. [2023-08-30 17:59:12,972 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-30 17:59:12,972 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-08-30 17:59:12,973 INFO L137 encePairwiseOnDemand]: 419/430 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-08-30 17:59:12,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-08-30 17:59:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 17:59:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 17:59:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2530 transitions. [2023-08-30 17:59:12,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34610123119015046 [2023-08-30 17:59:12,992 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2530 transitions. [2023-08-30 17:59:12,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2530 transitions. [2023-08-30 17:59:12,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:12,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2530 transitions. [2023-08-30 17:59:13,001 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-08-30 17:59:13,010 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-08-30 17:59:13,012 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-08-30 17:59:13,013 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 17 states and 2530 transitions. [2023-08-30 17:59:13,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-08-30 17:59:13,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 423 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-30 17:59:13,015 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-08-30 17:59:13,016 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-08-30 17:59:13,016 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-08-30 17:59:13,017 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-08-30 17:59:13,018 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-08-30 17:59:13,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:13,018 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-08-30 17:59:13,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 17:59:13,225 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-08-30 17:59:13,225 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-08-30 17:59:13,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 470240073, now seen corresponding path program 1 times [2023-08-30 17:59:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691918544] [2023-08-30 17:59:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:14,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691918544] [2023-08-30 17:59:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691918544] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603481699] [2023-08-30 17:59:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:14,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:14,534 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-08-30 17:59:14,540 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-08-30 17:59:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:14,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 17:59:14,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:14,640 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-08-30 17:59:14,709 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:14,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:59:14,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 17:59:14,850 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-08-30 17:59:14,928 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-08-30 17:59:14,973 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-08-30 17:59:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:18,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:34,220 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-08-30 17:59:36,246 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-08-30 17:59:36,284 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-08-30 17:59:36,321 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-08-30 17:59:36,378 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-08-30 17:59:36,426 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-08-30 17:59:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-30 17:59:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603481699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:36,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-08-30 17:59:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886070871] [2023-08-30 17:59:36,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:36,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 17:59:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 17:59:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=387, Unknown=16, NotChecked=270, Total=756 [2023-08-30 17:59:36,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-30 17:59:36,755 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-08-30 17:59:36,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:36,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-30 17:59:36,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:40,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:00:07,156 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-08-30 18:00:19,156 INFO L130 PetriNetUnfolder]: 134/391 cut-off events. [2023-08-30 18:00:19,157 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2023-08-30 18:00:19,158 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-08-30 18:00:19,160 INFO L137 encePairwiseOnDemand]: 418/430 looper letters, 132 selfloop transitions, 56 changer transitions 0/192 dead transitions. [2023-08-30 18:00:19,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 192 transitions, 1159 flow [2023-08-30 18:00:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 18:00:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 18:00:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3236 transitions. [2023-08-30 18:00:19,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583610188261351 [2023-08-30 18:00:19,171 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3236 transitions. [2023-08-30 18:00:19,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3236 transitions. [2023-08-30 18:00:19,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:19,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3236 transitions. [2023-08-30 18:00:19,181 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-08-30 18:00:19,206 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-08-30 18:00:19,210 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-08-30 18:00:19,210 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 265 flow. Second operand 21 states and 3236 transitions. [2023-08-30 18:00:19,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 192 transitions, 1159 flow [2023-08-30 18:00:19,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 192 transitions, 1126 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-30 18:00:19,220 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 721 flow [2023-08-30 18:00:19,220 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-08-30 18:00:19,221 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2023-08-30 18:00:19,222 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 721 flow [2023-08-30 18:00:19,223 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-08-30 18:00:19,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:19,223 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-08-30 18:00:19,230 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-08-30 18:00:19,430 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-08-30 18:00:19,430 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-08-30 18:00:19,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1435047, now seen corresponding path program 2 times [2023-08-30 18:00:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54920124] [2023-08-30 18:00:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54920124] [2023-08-30 18:00:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54920124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719460904] [2023-08-30 18:00:20,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:20,613 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-08-30 18:00:20,620 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-08-30 18:00:20,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:20,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:20,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:00:20,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:20,744 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-08-30 18:00:20,821 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:20,821 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-08-30 18:00:20,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:00:20,958 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-08-30 18:00:21,049 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-08-30 18:00:23,363 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-08-30 18:00:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:23,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:23,413 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-30 18:00:25,427 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-08-30 18:00:27,439 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-08-30 18:00:29,473 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-08-30 18:00:29,546 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-08-30 18:00:29,575 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-08-30 18:00:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-30 18:00:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719460904] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:29,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-30 18:00:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495903764] [2023-08-30 18:00:29,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:29,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 18:00:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:29,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 18:00:29,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=363, Unknown=8, NotChecked=258, Total=702 [2023-08-30 18:00:29,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-30 18:00:29,778 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-08-30 18:00:29,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:29,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-30 18:00:29,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:30,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:00:32,948 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-08-30 18:00:55,763 WARN L222 SmtUtils]: Spent 18.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-08-30 18:01:08,003 INFO L130 PetriNetUnfolder]: 174/574 cut-off events. [2023-08-30 18:01:08,003 INFO L131 PetriNetUnfolder]: For 1465/1465 co-relation queries the response was YES. [2023-08-30 18:01:08,005 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-08-30 18:01:08,008 INFO L137 encePairwiseOnDemand]: 420/430 looper letters, 171 selfloop transitions, 64 changer transitions 0/239 dead transitions. [2023-08-30 18:01:08,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 1969 flow [2023-08-30 18:01:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 18:01:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 18:01:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3242 transitions. [2023-08-30 18:01:08,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35902547065337764 [2023-08-30 18:01:08,017 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3242 transitions. [2023-08-30 18:01:08,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3242 transitions. [2023-08-30 18:01:08,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:08,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3242 transitions. [2023-08-30 18:01:08,025 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-08-30 18:01:08,035 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-08-30 18:01:08,037 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-08-30 18:01:08,037 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 721 flow. Second operand 21 states and 3242 transitions. [2023-08-30 18:01:08,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 1969 flow [2023-08-30 18:01:08,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 239 transitions, 1937 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 18:01:08,048 INFO L231 Difference]: Finished difference. Result has 118 places, 138 transitions, 1145 flow [2023-08-30 18:01:08,048 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-08-30 18:01:08,049 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2023-08-30 18:01:08,049 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 138 transitions, 1145 flow [2023-08-30 18:01:08,050 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-08-30 18:01:08,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:08,051 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-08-30 18:01:08,067 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-08-30 18:01:08,257 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-08-30 18:01:08,257 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-08-30 18:01:08,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1374964814, now seen corresponding path program 3 times [2023-08-30 18:01:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485717739] [2023-08-30 18:01:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485717739] [2023-08-30 18:01:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485717739] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:09,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226413127] [2023-08-30 18:01:09,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:01:09,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:09,214 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-08-30 18:01:09,216 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-08-30 18:01:09,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:01:09,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:09,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-30 18:01:09,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:09,353 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-08-30 18:01:09,408 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:09,409 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-08-30 18:01:09,417 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-08-30 18:01:09,505 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-08-30 18:01:09,549 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-08-30 18:01:09,607 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-08-30 18:01:09,733 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-08-30 18:01:09,793 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-08-30 18:01:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:19,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:33,451 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-08-30 18:01:35,471 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-08-30 18:02:01,704 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-08-30 18:02:03,719 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-08-30 18:02:03,840 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-08-30 18:02:03,873 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-08-30 18:02:03,885 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-08-30 18:02:22,167 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-08-30 18:02:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 15 not checked. [2023-08-30 18:02:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226413127] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:22,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-08-30 18:02:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727403722] [2023-08-30 18:02:22,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:22,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 18:02:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 18:02:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=538, Unknown=49, NotChecked=456, Total=1190 [2023-08-30 18:02:22,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-08-30 18:02:22,424 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-08-30 18:02:22,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:22,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-08-30 18:02:22,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:23,543 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-08-30 18:02:24,812 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-08-30 18:02:26,041 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-08-30 18:02:28,633 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-08-30 18:02:29,840 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-08-30 18:02:31,001 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-08-30 18:02:32,118 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-08-30 18:02:33,364 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-08-30 18:02:34,626 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-08-30 18:02:38,695 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-08-30 18:02:41,714 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-08-30 18:02:42,864 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-08-30 18:02:46,384 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-08-30 18:02:47,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:56,540 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-08-30 18:03:07,185 WARN L222 SmtUtils]: Spent 8.27s 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-08-30 18:03:17,306 WARN L222 SmtUtils]: Spent 8.05s 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-08-30 18:03:29,482 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-08-30 18:03:32,657 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-08-30 18:03:33,880 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-08-30 18:03:37,600 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-08-30 18:03:39,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:40,262 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-08-30 18:03:41,519 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-08-30 18:03:45,205 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-08-30 18:03:46,450 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-08-30 18:03:47,632 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-08-30 18:04:06,954 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-08-30 18:04:08,206 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-08-30 18:04:09,517 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-08-30 18:04:10,812 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-08-30 18:04:12,127 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-08-30 18:04:24,654 WARN L222 SmtUtils]: Spent 12.49s 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-08-30 18:04:31,516 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-08-30 18:04:33,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:04:35,530 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-08-30 18:04:37,536 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-08-30 18:04:39,541 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-08-30 18:04:40,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:44,184 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-08-30 18:05:10,697 INFO L130 PetriNetUnfolder]: 198/724 cut-off events. [2023-08-30 18:05:10,697 INFO L131 PetriNetUnfolder]: For 3036/3036 co-relation queries the response was YES. [2023-08-30 18:05:10,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 724 events. 198/724 cut-off events. For 3036/3036 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3588 event pairs, 7 based on Foata normal form. 4/696 useless extension candidates. Maximal degree in co-relation 2919. Up to 160 conditions per place. [2023-08-30 18:05:10,702 INFO L137 encePairwiseOnDemand]: 414/430 looper letters, 97 selfloop transitions, 79 changer transitions 68/248 dead transitions. [2023-08-30 18:05:10,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 248 transitions, 2476 flow [2023-08-30 18:05:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 18:05:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 18:05:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3704 transitions. [2023-08-30 18:05:10,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35891472868217056 [2023-08-30 18:05:10,720 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3704 transitions. [2023-08-30 18:05:10,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3704 transitions. [2023-08-30 18:05:10,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:10,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3704 transitions. [2023-08-30 18:05:10,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 154.33333333333334) internal successors, (3704), 24 states have internal predecessors, (3704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:10,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 430.0) internal successors, (10750), 25 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:10,743 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 430.0) internal successors, (10750), 25 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:10,743 INFO L175 Difference]: Start difference. First operand has 118 places, 138 transitions, 1145 flow. Second operand 24 states and 3704 transitions. [2023-08-30 18:05:10,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 248 transitions, 2476 flow [2023-08-30 18:05:10,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 248 transitions, 2406 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-08-30 18:05:10,760 INFO L231 Difference]: Finished difference. Result has 149 places, 134 transitions, 1406 flow [2023-08-30 18:05:10,760 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=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1406, PETRI_PLACES=149, PETRI_TRANSITIONS=134} [2023-08-30 18:05:10,762 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 86 predicate places. [2023-08-30 18:05:10,762 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 134 transitions, 1406 flow [2023-08-30 18:05:10,763 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-08-30 18:05:10,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:10,764 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-08-30 18:05:10,774 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-08-30 18:05:10,970 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-08-30 18:05:10,970 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-08-30 18:05:10,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -946426340, now seen corresponding path program 4 times [2023-08-30 18:05:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731899144] [2023-08-30 18:05:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:05:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731899144] [2023-08-30 18:05:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731899144] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094694070] [2023-08-30 18:05:23,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:05:23,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:23,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:23,345 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-08-30 18:05:23,352 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-08-30 18:05:23,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:05:23,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:23,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 104 conjunts are in the unsatisfiable core [2023-08-30 18:05:23,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:23,684 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-08-30 18:05:23,731 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:23,731 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-08-30 18:05:23,781 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-08-30 18:05:23,887 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-08-30 18:05:24,001 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-08-30 18:05:24,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-08-30 18:05:24,165 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-08-30 18:05:24,261 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-08-30 18:05:35,046 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-08-30 18:05:43,875 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-08-30 18:06:14,169 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-08-30 18:06:14,409 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-08-30 18:06:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 5 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-08-30 18:06:49,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:07:13,852 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-08-30 18:07:15,871 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-08-30 18:07:17,883 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-08-30 18:07:19,904 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-08-30 18:07:21,916 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-08-30 18:07:23,947 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-08-30 18:07:25,962 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-08-30 18:07:27,998 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-08-30 18:07:30,104 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-08-30 18:07:58,589 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-08-30 18:08:00,622 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-08-30 18:08:02,702 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-08-30 18:08:02,733 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-08-30 18:08:02,764 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-08-30 18:08:02,870 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-08-30 18:08:02,975 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-08-30 18:08:03,170 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-08-30 18:08:05,211 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-08-30 18:08:07,316 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-08-30 18:08:09,359 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-08-30 18:08:11,502 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-08-30 18:08:13,641 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-08-30 18:08:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 87 not checked. [2023-08-30 18:08:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094694070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:08:14,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:08:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 26] total 61 [2023-08-30 18:08:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145833866] [2023-08-30 18:08:14,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:08:14,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-08-30 18:08:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:08:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-08-30 18:08:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1286, Unknown=80, NotChecked=2178, Total=3906 [2023-08-30 18:08:14,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-08-30 18:08:14,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 134 transitions, 1406 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-08-30 18:08:14,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:08:14,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-08-30 18:08:14,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:08:16,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:17,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:19,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:25,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:27,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:28,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:30,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:36,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:38,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:46,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:47,621 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-08-30 18:08:49,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:50,474 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-08-30 18:09:07,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:09,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:11,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:13,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:15,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:17,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:18,742 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-08-30 18:09:20,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:22,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:23,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:25,397 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-08-30 18:09:37,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:39,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:40,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:42,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:44,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:51,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:53,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:55,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:56,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:09:58,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:00,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:01,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:03,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:05,335 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-08-30 18:10:07,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:08,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:10,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:12,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:13,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:15,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:17,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:19,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:20,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:28,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:30,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:44,323 WARN L222 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:10:49,193 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-08-30 18:10:50,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:52,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:10:59,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:01,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:11,666 WARN L222 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 61 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:11:13,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:15,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:25,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:27,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:29,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:11:31,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15