/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:08:20,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:08:20,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:08:20,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:08:20,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:08:20,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:08:20,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:08:20,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:08:20,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:08:20,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:08:20,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:08:20,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:08:20,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:08:20,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:08:20,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:08:20,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:08:20,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:08:20,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:08:20,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:08:20,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:08:20,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:08:20,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:08:20,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:08:20,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:08:20,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:08:20,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:08:20,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:08:20,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:08:20,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:08:20,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:08:20,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:08:20,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:08:20,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:08:20,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:08:20,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:08:20,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:08:20,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:08:20,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:08:20,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:08:20,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:08:20,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:08:20,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 06:08:20,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:08:20,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:08:20,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:08:20,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:08:20,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:08:20,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:08:20,516 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:08:20,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:08:20,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:08:20,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:08:20,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:08:20,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:08:20,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 06:08:20,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:08:20,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:08:20,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:08:20,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:08:20,724 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:08:20,725 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 [2022-01-19 06:08:20,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999e136e1/5da1614393714e318db2fdd00641d842/FLAGa92b2ec43 [2022-01-19 06:08:21,150 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:08:21,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-01-19 06:08:21,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999e136e1/5da1614393714e318db2fdd00641d842/FLAGa92b2ec43 [2022-01-19 06:08:21,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999e136e1/5da1614393714e318db2fdd00641d842 [2022-01-19 06:08:21,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:08:21,171 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:08:21,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:08:21,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:08:21,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:08:21,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cff3d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21, skipping insertion in model container [2022-01-19 06:08:21,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:08:21,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:08:21,544 WARN L230 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] [2022-01-19 06:08:21,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:08:21,585 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:08:21,617 WARN L230 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] [2022-01-19 06:08:21,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:08:21,675 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:08:21,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21 WrapperNode [2022-01-19 06:08:21,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:08:21,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:08:21,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:08:21,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:08:21,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,736 INFO L137 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2022-01-19 06:08:21,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:08:21,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:08:21,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:08:21,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:08:21,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:08:21,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:08:21,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:08:21,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:08:21,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (1/1) ... [2022-01-19 06:08:21,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:08:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:21,810 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) [2022-01-19 06:08:21,826 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 [2022-01-19 06:08:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:08:21,838 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:08:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:08:21,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:08:21,839 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:08:21,952 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:08:21,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:08:22,175 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:08:22,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:08:22,185 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2022-01-19 06:08:22,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:08:22 BoogieIcfgContainer [2022-01-19 06:08:22,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:08:22,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:08:22,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:08:22,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:08:22,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:08:21" (1/3) ... [2022-01-19 06:08:22,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847c0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:08:22, skipping insertion in model container [2022-01-19 06:08:22,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:08:21" (2/3) ... [2022-01-19 06:08:22,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847c0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:08:22, skipping insertion in model container [2022-01-19 06:08:22,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:08:22" (3/3) ... [2022-01-19 06:08:22,201 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2022-01-19 06:08:22,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:08:22,205 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 06:08:22,205 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:08:22,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,247 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,253 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,253 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,253 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,253 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,253 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,255 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,256 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,257 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,258 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:22,261 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:08:22,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:08:22,296 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:08:22,296 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:08:22,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 255 transitions, 518 flow [2022-01-19 06:08:22,368 INFO L129 PetriNetUnfolder]: 73/394 cut-off events. [2022-01-19 06:08:22,368 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:08:22,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 394 events. 73/394 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1796 event pairs, 0 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 215. Up to 8 conditions per place. [2022-01-19 06:08:22,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 255 transitions, 518 flow [2022-01-19 06:08:22,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 250 transitions, 505 flow [2022-01-19 06:08:22,398 INFO L129 PetriNetUnfolder]: 19/171 cut-off events. [2022-01-19 06:08:22,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:08:22,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:22,399 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:22,400 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1729971599, now seen corresponding path program 1 times [2022-01-19 06:08:22,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883945199] [2022-01-19 06:08:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:22,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:22,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:22,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883945199] [2022-01-19 06:08:22,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883945199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:08:22,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:08:22,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:08:22,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067812262] [2022-01-19 06:08:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:08:22,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:08:22,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:22,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:08:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:08:22,554 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 255 [2022-01-19 06:08:22,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 250 transitions, 505 flow. Second operand has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:22,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 255 [2022-01-19 06:08:22,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:22,596 INFO L129 PetriNetUnfolder]: 9/321 cut-off events. [2022-01-19 06:08:22,596 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:08:22,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 321 events. 9/321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1417 event pairs, 0 based on Foata normal form. 63/366 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2022-01-19 06:08:22,599 INFO L132 encePairwiseOnDemand]: 217/255 looper letters, 1 selfloop transitions, 0 changer transitions 0/209 dead transitions. [2022-01-19 06:08:22,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 209 transitions, 425 flow [2022-01-19 06:08:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:08:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:08:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2022-01-19 06:08:22,609 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.907843137254902 [2022-01-19 06:08:22,609 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2022-01-19 06:08:22,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2022-01-19 06:08:22,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:22,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2022-01-19 06:08:22,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,619 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,620 INFO L186 Difference]: Start difference. First operand has 209 places, 250 transitions, 505 flow. Second operand 2 states and 463 transitions. [2022-01-19 06:08:22,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 209 transitions, 425 flow [2022-01-19 06:08:22,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 209 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:08:22,626 INFO L242 Difference]: Finished difference. Result has 207 places, 209 transitions, 423 flow [2022-01-19 06:08:22,627 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=423, PETRI_PLACES=207, PETRI_TRANSITIONS=209} [2022-01-19 06:08:22,630 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -2 predicate places. [2022-01-19 06:08:22,630 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 209 transitions, 423 flow [2022-01-19 06:08:22,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,631 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:22,631 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:22,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:08:22,631 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1941322512, now seen corresponding path program 1 times [2022-01-19 06:08:22,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:22,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386864362] [2022-01-19 06:08:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:22,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:22,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386864362] [2022-01-19 06:08:22,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386864362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:08:22,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:08:22,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:08:22,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942675701] [2022-01-19 06:08:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:08:22,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:08:22,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:08:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:08:22,676 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 255 [2022-01-19 06:08:22,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 209 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:22,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 255 [2022-01-19 06:08:22,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:22,710 INFO L129 PetriNetUnfolder]: 9/325 cut-off events. [2022-01-19 06:08:22,710 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:08:22,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 325 events. 9/325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1415 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 340. Up to 9 conditions per place. [2022-01-19 06:08:22,712 INFO L132 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2022-01-19 06:08:22,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 213 transitions, 455 flow [2022-01-19 06:08:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:08:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:08:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2022-01-19 06:08:22,715 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8209150326797385 [2022-01-19 06:08:22,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2022-01-19 06:08:22,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2022-01-19 06:08:22,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:22,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2022-01-19 06:08:22,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,719 INFO L186 Difference]: Start difference. First operand has 207 places, 209 transitions, 423 flow. Second operand 3 states and 628 transitions. [2022-01-19 06:08:22,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 213 transitions, 455 flow [2022-01-19 06:08:22,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 213 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:08:22,722 INFO L242 Difference]: Finished difference. Result has 210 places, 210 transitions, 435 flow [2022-01-19 06:08:22,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2022-01-19 06:08:22,723 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 1 predicate places. [2022-01-19 06:08:22,724 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 435 flow [2022-01-19 06:08:22,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,724 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:22,724 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:22,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:08:22,725 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1946238832, now seen corresponding path program 1 times [2022-01-19 06:08:22,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:22,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606658175] [2022-01-19 06:08:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:22,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:22,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:22,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606658175] [2022-01-19 06:08:22,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606658175] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:22,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484861078] [2022-01-19 06:08:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:22,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:22,776 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) [2022-01-19 06:08:22,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:08:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:22,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:08:22,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:08:22,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:08:22,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484861078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:08:22,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:08:22,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:08:22,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379279961] [2022-01-19 06:08:22,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:08:22,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:08:22,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:08:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:08:22,980 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 255 [2022-01-19 06:08:22,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:22,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:22,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 255 [2022-01-19 06:08:22,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:23,016 INFO L129 PetriNetUnfolder]: 6/217 cut-off events. [2022-01-19 06:08:23,016 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:08:23,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 217 events. 6/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 655 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 235. Up to 6 conditions per place. [2022-01-19 06:08:23,018 INFO L132 encePairwiseOnDemand]: 252/255 looper letters, 8 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2022-01-19 06:08:23,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 212 transitions, 459 flow [2022-01-19 06:08:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:08:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:08:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2022-01-19 06:08:23,020 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183006535947712 [2022-01-19 06:08:23,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2022-01-19 06:08:23,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2022-01-19 06:08:23,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:23,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2022-01-19 06:08:23,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,029 INFO L186 Difference]: Start difference. First operand has 210 places, 210 transitions, 435 flow. Second operand 3 states and 626 transitions. [2022-01-19 06:08:23,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 212 transitions, 459 flow [2022-01-19 06:08:23,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 212 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:08:23,033 INFO L242 Difference]: Finished difference. Result has 212 places, 210 transitions, 441 flow [2022-01-19 06:08:23,033 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=212, PETRI_TRANSITIONS=210} [2022-01-19 06:08:23,035 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 3 predicate places. [2022-01-19 06:08:23,036 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 210 transitions, 441 flow [2022-01-19 06:08:23,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,037 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:23,037 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:23,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:23,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:23,263 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1108947154, now seen corresponding path program 1 times [2022-01-19 06:08:23,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:23,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511872009] [2022-01-19 06:08:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:23,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:23,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511872009] [2022-01-19 06:08:23,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511872009] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975931332] [2022-01-19 06:08:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:23,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:23,333 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) [2022-01-19 06:08:23,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:08:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:23,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:08:23,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:23,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:08:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:23,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975931332] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:08:23,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:08:23,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:08:23,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579577274] [2022-01-19 06:08:23,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:08:23,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:08:23,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:08:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:08:23,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 255 [2022-01-19 06:08:23,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 210 transitions, 441 flow. Second operand has 10 states, 10 states have (on average 206.1) internal successors, (2061), 10 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:23,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 255 [2022-01-19 06:08:23,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:23,704 INFO L129 PetriNetUnfolder]: 6/224 cut-off events. [2022-01-19 06:08:23,705 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:08:23,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 224 events. 6/224 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 651 event pairs, 0 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 256. Up to 6 conditions per place. [2022-01-19 06:08:23,707 INFO L132 encePairwiseOnDemand]: 249/255 looper letters, 11 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-01-19 06:08:23,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 220 transitions, 503 flow [2022-01-19 06:08:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:08:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:08:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1858 transitions. [2022-01-19 06:08:23,710 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8095860566448801 [2022-01-19 06:08:23,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1858 transitions. [2022-01-19 06:08:23,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1858 transitions. [2022-01-19 06:08:23,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:23,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1858 transitions. [2022-01-19 06:08:23,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 206.44444444444446) internal successors, (1858), 9 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,718 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,719 INFO L186 Difference]: Start difference. First operand has 212 places, 210 transitions, 441 flow. Second operand 9 states and 1858 transitions. [2022-01-19 06:08:23,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 220 transitions, 503 flow [2022-01-19 06:08:23,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 220 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:08:23,723 INFO L242 Difference]: Finished difference. Result has 221 places, 216 transitions, 487 flow [2022-01-19 06:08:23,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=221, PETRI_TRANSITIONS=216} [2022-01-19 06:08:23,727 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 12 predicate places. [2022-01-19 06:08:23,727 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 216 transitions, 487 flow [2022-01-19 06:08:23,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.1) internal successors, (2061), 10 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:23,729 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:23,729 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:23,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:23,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 06:08:23,946 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 173261010, now seen corresponding path program 2 times [2022-01-19 06:08:23,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:23,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884107165] [2022-01-19 06:08:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:23,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:08:24,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:24,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884107165] [2022-01-19 06:08:24,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884107165] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:24,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210734557] [2022-01-19 06:08:24,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:08:24,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:24,020 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) [2022-01-19 06:08:24,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:08:24,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 06:08:24,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:08:24,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:08:24,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:24,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:24,312 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:08:24,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:24,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:24,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:08:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:08:24,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:08:24,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210734557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:08:24,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:08:24,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-01-19 06:08:24,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496662446] [2022-01-19 06:08:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:08:24,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 06:08:24,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 06:08:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:08:24,491 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 255 [2022-01-19 06:08:24,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 216 transitions, 487 flow. Second operand has 12 states, 12 states have (on average 164.33333333333334) internal successors, (1972), 12 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:24,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:24,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 255 [2022-01-19 06:08:24,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:25,349 INFO L129 PetriNetUnfolder]: 1137/4929 cut-off events. [2022-01-19 06:08:25,349 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 06:08:25,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 4929 events. 1137/4929 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 49402 event pairs, 121 based on Foata normal form. 0/4634 useless extension candidates. Maximal degree in co-relation 6968. Up to 704 conditions per place. [2022-01-19 06:08:25,370 INFO L132 encePairwiseOnDemand]: 230/255 looper letters, 184 selfloop transitions, 44 changer transitions 0/393 dead transitions. [2022-01-19 06:08:25,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 393 transitions, 1297 flow [2022-01-19 06:08:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 06:08:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 06:08:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2659 transitions. [2022-01-19 06:08:25,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6951633986928104 [2022-01-19 06:08:25,375 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2659 transitions. [2022-01-19 06:08:25,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2659 transitions. [2022-01-19 06:08:25,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:25,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2659 transitions. [2022-01-19 06:08:25,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 177.26666666666668) internal successors, (2659), 15 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:25,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:25,384 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:25,384 INFO L186 Difference]: Start difference. First operand has 221 places, 216 transitions, 487 flow. Second operand 15 states and 2659 transitions. [2022-01-19 06:08:25,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 393 transitions, 1297 flow [2022-01-19 06:08:25,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 393 transitions, 1291 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 06:08:25,390 INFO L242 Difference]: Finished difference. Result has 245 places, 256 transitions, 794 flow [2022-01-19 06:08:25,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=794, PETRI_PLACES=245, PETRI_TRANSITIONS=256} [2022-01-19 06:08:25,390 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 36 predicate places. [2022-01-19 06:08:25,390 INFO L470 AbstractCegarLoop]: Abstraction has has 245 places, 256 transitions, 794 flow [2022-01-19 06:08:25,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 164.33333333333334) internal successors, (1972), 12 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:25,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:25,391 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:25,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:25,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:25,607 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:25,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1162729581, now seen corresponding path program 1 times [2022-01-19 06:08:25,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:25,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530209298] [2022-01-19 06:08:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:25,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:08:25,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:25,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530209298] [2022-01-19 06:08:25,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530209298] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:25,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441244257] [2022-01-19 06:08:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:25,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:25,660 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) [2022-01-19 06:08:25,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:08:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:25,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:08:25,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 06:08:25,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:08:25,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441244257] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:08:25,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:08:25,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:08:25,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056600321] [2022-01-19 06:08:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:08:25,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:08:25,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:08:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:08:25,793 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 255 [2022-01-19 06:08:25,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 256 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:25,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:25,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 255 [2022-01-19 06:08:25,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:26,019 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([662] L953-16-->L959: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_~#t_ids~0#1.offset][252], [Black: 972#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 970#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 965#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|), Black: 976#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| (select ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 958#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|), 376#true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 380#(<= |ULTIMATE.start_main_~i~1#1| 1), 997#true, t_funThread1of1ForFork0InUse, Black: 325#(<= |ULTIMATE.start_main_~i~3#1| 0), 746#true, 21#L946-5true, Black: 982#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), Black: 811#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 807#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 216#true, Black: 980#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), Black: 974#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 178#L959true, Black: 978#(and (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|)), Black: 221#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2022-01-19 06:08:26,019 INFO L384 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-01-19 06:08:26,019 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-19 06:08:26,019 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-01-19 06:08:26,019 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-01-19 06:08:26,024 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([662] L953-16-->L959: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_~#t_ids~0#1.offset][252], [Black: 972#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 970#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 965#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|), Black: 976#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| (select ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 958#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|), 376#true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 380#(<= |ULTIMATE.start_main_~i~1#1| 1), 997#true, 106#L940true, t_funThread1of1ForFork0InUse, Black: 325#(<= |ULTIMATE.start_main_~i~3#1| 0), 746#true, Black: 982#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), Black: 811#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 807#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 980#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), 216#true, Black: 974#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 178#L959true, Black: 978#(and (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|)), Black: 221#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2022-01-19 06:08:26,024 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-01-19 06:08:26,024 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-01-19 06:08:26,024 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-01-19 06:08:26,024 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-01-19 06:08:26,038 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([662] L953-16-->L959: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_~#t_ids~0#1.offset][252], [Black: 972#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 970#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 965#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|), Black: 976#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| (select ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 958#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|), 376#true, 190#L941-30true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 380#(<= |ULTIMATE.start_main_~i~1#1| 1), 997#true, t_funThread1of1ForFork0InUse, Black: 325#(<= |ULTIMATE.start_main_~i~3#1| 0), 746#true, Black: 982#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), Black: 811#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 807#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 980#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), 216#true, Black: 974#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 178#L959true, Black: 978#(and (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|)), Black: 221#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2022-01-19 06:08:26,038 INFO L384 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-01-19 06:08:26,038 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-01-19 06:08:26,038 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-01-19 06:08:26,039 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-01-19 06:08:26,043 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([662] L953-16-->L959: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_~#t_ids~0#1.offset][252], [Black: 972#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 970#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 42#L941-8true, Black: 965#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|), Black: 976#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| (select ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 958#(<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|), 376#true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 380#(<= |ULTIMATE.start_main_~i~1#1| 1), 997#true, t_funThread1of1ForFork0InUse, Black: 325#(<= |ULTIMATE.start_main_~i~3#1| 0), 746#true, Black: 982#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), Black: 811#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 807#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 980#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4)), 216#true, Black: 974#(and (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 178#L959true, Black: 978#(and (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1|)), Black: 221#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2022-01-19 06:08:26,044 INFO L384 tUnfolder$Statistics]: this new event has 162 ancestors and is cut-off event [2022-01-19 06:08:26,044 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-01-19 06:08:26,044 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-01-19 06:08:26,044 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-01-19 06:08:26,048 INFO L129 PetriNetUnfolder]: 222/2675 cut-off events. [2022-01-19 06:08:26,048 INFO L130 PetriNetUnfolder]: For 899/1157 co-relation queries the response was YES. [2022-01-19 06:08:26,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 2675 events. 222/2675 cut-off events. For 899/1157 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 23038 event pairs, 44 based on Foata normal form. 3/2508 useless extension candidates. Maximal degree in co-relation 3865. Up to 282 conditions per place. [2022-01-19 06:08:26,074 INFO L132 encePairwiseOnDemand]: 252/255 looper letters, 13 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2022-01-19 06:08:26,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 261 transitions, 840 flow [2022-01-19 06:08:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:08:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:08:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2022-01-19 06:08:26,076 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183006535947712 [2022-01-19 06:08:26,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2022-01-19 06:08:26,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2022-01-19 06:08:26,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:26,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2022-01-19 06:08:26,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,079 INFO L186 Difference]: Start difference. First operand has 245 places, 256 transitions, 794 flow. Second operand 3 states and 626 transitions. [2022-01-19 06:08:26,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 261 transitions, 840 flow [2022-01-19 06:08:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 261 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:08:26,086 INFO L242 Difference]: Finished difference. Result has 248 places, 257 transitions, 806 flow [2022-01-19 06:08:26,087 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2022-01-19 06:08:26,087 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 39 predicate places. [2022-01-19 06:08:26,087 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 806 flow [2022-01-19 06:08:26,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,088 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:26,088 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:26,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:26,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:26,304 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1532450281, now seen corresponding path program 1 times [2022-01-19 06:08:26,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619198716] [2022-01-19 06:08:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:26,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:08:26,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:26,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619198716] [2022-01-19 06:08:26,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619198716] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856258840] [2022-01-19 06:08:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:26,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:26,354 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) [2022-01-19 06:08:26,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:08:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:26,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:08:26,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:08:26,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:08:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:08:26,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856258840] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:08:26,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:08:26,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:08:26,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314299543] [2022-01-19 06:08:26,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:08:26,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:08:26,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:08:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:08:26,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 255 [2022-01-19 06:08:26,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 806 flow. Second operand has 19 states, 19 states have (on average 200.05263157894737) internal successors, (3801), 19 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:26,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 255 [2022-01-19 06:08:26,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:26,843 INFO L129 PetriNetUnfolder]: 9/325 cut-off events. [2022-01-19 06:08:26,844 INFO L130 PetriNetUnfolder]: For 47/55 co-relation queries the response was YES. [2022-01-19 06:08:26,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 325 events. 9/325 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 689 event pairs, 1 based on Foata normal form. 11/325 useless extension candidates. Maximal degree in co-relation 503. Up to 13 conditions per place. [2022-01-19 06:08:26,845 INFO L132 encePairwiseOnDemand]: 244/255 looper letters, 24 selfloop transitions, 25 changer transitions 3/145 dead transitions. [2022-01-19 06:08:26,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 145 transitions, 569 flow [2022-01-19 06:08:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:08:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:08:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4978 transitions. [2022-01-19 06:08:26,853 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7808627450980392 [2022-01-19 06:08:26,853 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4978 transitions. [2022-01-19 06:08:26,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4978 transitions. [2022-01-19 06:08:26,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:26,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4978 transitions. [2022-01-19 06:08:26,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 199.12) internal successors, (4978), 25 states have internal predecessors, (4978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 255.0) internal successors, (6630), 26 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,872 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 255.0) internal successors, (6630), 26 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,872 INFO L186 Difference]: Start difference. First operand has 248 places, 257 transitions, 806 flow. Second operand 25 states and 4978 transitions. [2022-01-19 06:08:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 145 transitions, 569 flow [2022-01-19 06:08:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 145 transitions, 549 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-01-19 06:08:26,878 INFO L242 Difference]: Finished difference. Result has 161 places, 129 transitions, 478 flow [2022-01-19 06:08:26,878 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=478, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2022-01-19 06:08:26,879 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -48 predicate places. [2022-01-19 06:08:26,879 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 478 flow [2022-01-19 06:08:26,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 200.05263157894737) internal successors, (3801), 19 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:26,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:26,880 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:26,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:27,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:27,096 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1001760418, now seen corresponding path program 1 times [2022-01-19 06:08:27,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:27,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046227733] [2022-01-19 06:08:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:27,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:08:27,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046227733] [2022-01-19 06:08:27,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046227733] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722169845] [2022-01-19 06:08:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:27,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:27,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:27,231 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) [2022-01-19 06:08:27,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:08:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:27,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:08:27,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:08:27,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:08:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:08:27,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722169845] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:08:27,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:08:27,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:08:27,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138034851] [2022-01-19 06:08:27,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:08:27,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:08:27,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:08:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:08:27,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 255 [2022-01-19 06:08:27,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 478 flow. Second operand has 23 states, 23 states have (on average 206.43478260869566) internal successors, (4748), 23 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:27,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:27,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 255 [2022-01-19 06:08:27,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:27,853 INFO L129 PetriNetUnfolder]: 9/325 cut-off events. [2022-01-19 06:08:27,853 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:08:27,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 325 events. 9/325 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 601 event pairs, 1 based on Foata normal form. 3/322 useless extension candidates. Maximal degree in co-relation 564. Up to 17 conditions per place. [2022-01-19 06:08:27,855 INFO L132 encePairwiseOnDemand]: 249/255 looper letters, 25 selfloop transitions, 30 changer transitions 0/155 dead transitions. [2022-01-19 06:08:27,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 155 transitions, 734 flow [2022-01-19 06:08:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:08:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:08:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6178 transitions. [2022-01-19 06:08:27,863 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8075816993464052 [2022-01-19 06:08:27,863 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6178 transitions. [2022-01-19 06:08:27,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6178 transitions. [2022-01-19 06:08:27,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:27,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6178 transitions. [2022-01-19 06:08:27,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 205.93333333333334) internal successors, (6178), 30 states have internal predecessors, (6178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:27,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 255.0) internal successors, (7905), 31 states have internal predecessors, (7905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:27,884 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 255.0) internal successors, (7905), 31 states have internal predecessors, (7905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:27,884 INFO L186 Difference]: Start difference. First operand has 161 places, 129 transitions, 478 flow. Second operand 30 states and 6178 transitions. [2022-01-19 06:08:27,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 155 transitions, 734 flow [2022-01-19 06:08:27,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 155 transitions, 698 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:08:27,888 INFO L242 Difference]: Finished difference. Result has 182 places, 139 transitions, 600 flow [2022-01-19 06:08:27,888 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=600, PETRI_PLACES=182, PETRI_TRANSITIONS=139} [2022-01-19 06:08:27,888 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -27 predicate places. [2022-01-19 06:08:27,888 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 139 transitions, 600 flow [2022-01-19 06:08:27,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 206.43478260869566) internal successors, (4748), 23 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:27,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:27,890 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:27,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:28,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:28,107 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 584235704, now seen corresponding path program 2 times [2022-01-19 06:08:28,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625029291] [2022-01-19 06:08:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:28,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:08:28,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625029291] [2022-01-19 06:08:28,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625029291] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804570168] [2022-01-19 06:08:28,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:08:28,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:28,404 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) [2022-01-19 06:08:28,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:08:28,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:08:28,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:08:28,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:08:28,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:28,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:28,860 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:08:28,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:28,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:29,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:08:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:08:29,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:08:37,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_260) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:08:37,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:08:37,728 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:08:37,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:08:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:08:37,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804570168] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:08:37,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:08:37,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-01-19 06:08:37,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916108881] [2022-01-19 06:08:37,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:08:37,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 06:08:37,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 06:08:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=4, NotChecked=50, Total=756 [2022-01-19 06:08:37,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 255 [2022-01-19 06:08:37,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 139 transitions, 600 flow. Second operand has 28 states, 28 states have (on average 145.46428571428572) internal successors, (4073), 28 states have internal predecessors, (4073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:37,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:37,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 255 [2022-01-19 06:08:37,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:08:38,656 INFO L129 PetriNetUnfolder]: 135/1025 cut-off events. [2022-01-19 06:08:38,656 INFO L130 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-01-19 06:08:38,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1025 events. 135/1025 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5921 event pairs, 0 based on Foata normal form. 3/1007 useless extension candidates. Maximal degree in co-relation 1988. Up to 116 conditions per place. [2022-01-19 06:08:38,662 INFO L132 encePairwiseOnDemand]: 238/255 looper letters, 128 selfloop transitions, 61 changer transitions 0/275 dead transitions. [2022-01-19 06:08:38,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 275 transitions, 1419 flow [2022-01-19 06:08:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 06:08:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 06:08:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4322 transitions. [2022-01-19 06:08:38,667 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5844489519945909 [2022-01-19 06:08:38,667 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4322 transitions. [2022-01-19 06:08:38,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4322 transitions. [2022-01-19 06:08:38,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:08:38,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4322 transitions. [2022-01-19 06:08:38,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 149.0344827586207) internal successors, (4322), 29 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:38,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 255.0) internal successors, (7650), 30 states have internal predecessors, (7650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:38,681 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 255.0) internal successors, (7650), 30 states have internal predecessors, (7650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:38,681 INFO L186 Difference]: Start difference. First operand has 182 places, 139 transitions, 600 flow. Second operand 29 states and 4322 transitions. [2022-01-19 06:08:38,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 275 transitions, 1419 flow [2022-01-19 06:08:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 275 transitions, 1375 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:08:38,687 INFO L242 Difference]: Finished difference. Result has 208 places, 199 transitions, 1096 flow [2022-01-19 06:08:38,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1096, PETRI_PLACES=208, PETRI_TRANSITIONS=199} [2022-01-19 06:08:38,688 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -1 predicate places. [2022-01-19 06:08:38,688 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 1096 flow [2022-01-19 06:08:38,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 145.46428571428572) internal successors, (4073), 28 states have internal predecessors, (4073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:38,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:08:38,689 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:08:38,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:08:38,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:38,906 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:08:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:08:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash -616054497, now seen corresponding path program 1 times [2022-01-19 06:08:38,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:08:38,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760821054] [2022-01-19 06:08:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:38,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:08:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:08:39,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:08:39,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760821054] [2022-01-19 06:08:39,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760821054] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:08:39,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587560772] [2022-01-19 06:08:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:08:39,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:08:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:08:39,745 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) [2022-01-19 06:08:39,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:08:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:08:39,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:08:39,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:08:39,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:40,197 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:08:40,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:40,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:40,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-19 06:08:40,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:08:40,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:08:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:08:40,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:08:42,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:08:44,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:08:46,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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_33|) 0)) is different from false [2022-01-19 06:08:48,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| 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_33|) 0)) is different from false [2022-01-19 06:08:50,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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_33|) 0)) is different from false [2022-01-19 06:08:51,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) is different from false [2022-01-19 06:08:51,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_352) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:08:51,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:08:51,850 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:08:51,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:08:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:08:51,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587560772] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:08:51,866 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:08:51,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-01-19 06:08:51,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164841409] [2022-01-19 06:08:51,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:08:51,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 06:08:51,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:08:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 06:08:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1402, Unknown=7, NotChecked=486, Total=2070 [2022-01-19 06:08:51,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 255 [2022-01-19 06:08:51,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 1096 flow. Second operand has 46 states, 46 states have (on average 146.7608695652174) internal successors, (6751), 46 states have internal predecessors, (6751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:08:51,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:08:51,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 255 [2022-01-19 06:08:51,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:06,070 WARN L228 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:18,134 WARN L228 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:30,176 WARN L228 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:39,886 WARN L228 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:45,632 WARN L228 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:46,004 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| 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_33|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:09:46,652 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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_33|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:09:47,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:09:54,530 WARN L228 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:09:54,867 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| 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_33|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:09:59,934 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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_33|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (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| 4)) is different from false [2022-01-19 06:10:00,235 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (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~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:10:10,589 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:10,650 INFO L129 PetriNetUnfolder]: 1143/4066 cut-off events. [2022-01-19 06:10:10,651 INFO L130 PetriNetUnfolder]: For 3366/3376 co-relation queries the response was YES. [2022-01-19 06:10:10,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9107 conditions, 4066 events. 1143/4066 cut-off events. For 3366/3376 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 28060 event pairs, 26 based on Foata normal form. 14/4004 useless extension candidates. Maximal degree in co-relation 9063. Up to 1279 conditions per place. [2022-01-19 06:10:10,677 INFO L132 encePairwiseOnDemand]: 226/255 looper letters, 260 selfloop transitions, 215 changer transitions 0/552 dead transitions. [2022-01-19 06:10:10,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 552 transitions, 3396 flow [2022-01-19 06:10:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 06:10:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 06:10:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 9148 transitions. [2022-01-19 06:10:10,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5881067180970749 [2022-01-19 06:10:10,685 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 9148 transitions. [2022-01-19 06:10:10,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 9148 transitions. [2022-01-19 06:10:10,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:10:10,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 9148 transitions. [2022-01-19 06:10:10,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 149.9672131147541) internal successors, (9148), 61 states have internal predecessors, (9148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:10,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 255.0) internal successors, (15810), 62 states have internal predecessors, (15810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:10,711 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 255.0) internal successors, (15810), 62 states have internal predecessors, (15810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:10,711 INFO L186 Difference]: Start difference. First operand has 208 places, 199 transitions, 1096 flow. Second operand 61 states and 9148 transitions. [2022-01-19 06:10:10,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 552 transitions, 3396 flow [2022-01-19 06:10:10,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 552 transitions, 3225 flow, removed 82 selfloop flow, removed 4 redundant places. [2022-01-19 06:10:10,729 INFO L242 Difference]: Finished difference. Result has 302 places, 414 transitions, 2827 flow [2022-01-19 06:10:10,730 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=2827, PETRI_PLACES=302, PETRI_TRANSITIONS=414} [2022-01-19 06:10:10,730 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 93 predicate places. [2022-01-19 06:10:10,730 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 414 transitions, 2827 flow [2022-01-19 06:10:10,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 146.7608695652174) internal successors, (6751), 46 states have internal predecessors, (6751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:10,732 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:10:10,732 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:10:10,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 06:10:10,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 06:10:10,949 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:10:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:10:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash -887350369, now seen corresponding path program 1 times [2022-01-19 06:10:10,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:10:10,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151138294] [2022-01-19 06:10:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:10,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:10:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:10:11,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:10:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151138294] [2022-01-19 06:10:11,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151138294] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:10:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337432522] [2022-01-19 06:10:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:11,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:10:11,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:10:11,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:10:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:11,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-19 06:10:11,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:10:11,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:12,068 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:10:12,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:12,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:12,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:12,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:10:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:10:12,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:10:16,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_437) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:10:16,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_437) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:10:17,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:10:17,113 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:10:17,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:10:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 18 not checked. [2022-01-19 06:10:17,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337432522] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:10:17,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:10:17,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 36 [2022-01-19 06:10:17,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54699583] [2022-01-19 06:10:17,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:10:17,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 06:10:17,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:10:17,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 06:10:17,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1008, Unknown=4, NotChecked=130, Total=1260 [2022-01-19 06:10:17,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 255 [2022-01-19 06:10:17,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 414 transitions, 2827 flow. Second operand has 36 states, 36 states have (on average 152.55555555555554) internal successors, (5492), 36 states have internal predecessors, (5492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:17,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:10:17,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 255 [2022-01-19 06:10:17,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:10:19,328 INFO L129 PetriNetUnfolder]: 1255/4745 cut-off events. [2022-01-19 06:10:19,329 INFO L130 PetriNetUnfolder]: For 36570/36621 co-relation queries the response was YES. [2022-01-19 06:10:19,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17396 conditions, 4745 events. 1255/4745 cut-off events. For 36570/36621 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 34171 event pairs, 85 based on Foata normal form. 5/4645 useless extension candidates. Maximal degree in co-relation 17315. Up to 743 conditions per place. [2022-01-19 06:10:19,395 INFO L132 encePairwiseOnDemand]: 236/255 looper letters, 415 selfloop transitions, 105 changer transitions 0/616 dead transitions. [2022-01-19 06:10:19,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 616 transitions, 5888 flow [2022-01-19 06:10:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:10:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:10:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3784 transitions. [2022-01-19 06:10:19,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6183006535947713 [2022-01-19 06:10:19,402 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3784 transitions. [2022-01-19 06:10:19,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3784 transitions. [2022-01-19 06:10:19,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:10:19,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3784 transitions. [2022-01-19 06:10:19,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 157.66666666666666) internal successors, (3784), 24 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:19,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 255.0) internal successors, (6375), 25 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:19,488 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 255.0) internal successors, (6375), 25 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:19,488 INFO L186 Difference]: Start difference. First operand has 302 places, 414 transitions, 2827 flow. Second operand 24 states and 3784 transitions. [2022-01-19 06:10:19,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 616 transitions, 5888 flow [2022-01-19 06:10:19,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 616 transitions, 5680 flow, removed 100 selfloop flow, removed 4 redundant places. [2022-01-19 06:10:19,556 INFO L242 Difference]: Finished difference. Result has 330 places, 432 transitions, 3177 flow [2022-01-19 06:10:19,556 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=2671, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3177, PETRI_PLACES=330, PETRI_TRANSITIONS=432} [2022-01-19 06:10:19,557 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 121 predicate places. [2022-01-19 06:10:19,557 INFO L470 AbstractCegarLoop]: Abstraction has has 330 places, 432 transitions, 3177 flow [2022-01-19 06:10:19,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 152.55555555555554) internal successors, (5492), 36 states have internal predecessors, (5492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:19,558 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:10:19,558 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:10:19,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 06:10:19,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:19,774 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:10:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:10:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash 776486780, now seen corresponding path program 1 times [2022-01-19 06:10:19,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:10:19,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892127135] [2022-01-19 06:10:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:19,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:10:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:10:20,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:10:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892127135] [2022-01-19 06:10:20,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892127135] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:10:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517038833] [2022-01-19 06:10:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:20,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:20,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:10:20,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:10:20,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:10:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:20,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:10:20,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:10:20,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:20,992 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:10:20,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:21,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:21,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-19 06:10:21,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:10:21,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:10:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:10:21,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:10:23,670 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:10:25,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-01-19 06:10:27,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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_44|) 0)) is different from false [2022-01-19 06:10:28,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 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_44|) 0)) is different from false [2022-01-19 06:10:28,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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_44|) 0)) is different from false [2022-01-19 06:10:30,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) is different from false [2022-01-19 06:10:30,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_529) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:10:30,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:10:30,716 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:10:30,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:10:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:10:30,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517038833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:10:30,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:10:30,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:10:30,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231503411] [2022-01-19 06:10:30,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:10:30,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:10:30,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:10:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:10:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1476, Unknown=7, NotChecked=498, Total=2162 [2022-01-19 06:10:30,732 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 255 [2022-01-19 06:10:30,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 432 transitions, 3177 flow. Second operand has 47 states, 47 states have (on average 146.7659574468085) internal successors, (6898), 47 states have internal predecessors, (6898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:30,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:10:30,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 255 [2022-01-19 06:10:30,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:10:42,617 WARN L228 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 62 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:46,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (let ((.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) .cse3 (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= |c_ULTIMATE.start_main_~i~3#1| 0))) (and .cse3 (= .cse0 .cse1)))) .cse3 (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (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| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:10:57,634 WARN L228 SmtUtils]: Spent 11.47s on a formula simplification. DAG size of input: 62 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:58,059 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (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_44|) 0)) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:10:58,526 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |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_44|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:10:58,932 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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_44|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (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| 4)) is different from false [2022-01-19 06:10:59,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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_44|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:10:59,628 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (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~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:11:00,123 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:11:11,180 WARN L228 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:21,323 WARN L228 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:31,813 WARN L228 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:40,218 WARN L228 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:47,826 WARN L228 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:48,491 INFO L129 PetriNetUnfolder]: 1730/6704 cut-off events. [2022-01-19 06:11:48,491 INFO L130 PetriNetUnfolder]: For 58693/58740 co-relation queries the response was YES. [2022-01-19 06:11:48,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26287 conditions, 6704 events. 1730/6704 cut-off events. For 58693/58740 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 55662 event pairs, 75 based on Foata normal form. 30/6599 useless extension candidates. Maximal degree in co-relation 26196. Up to 1339 conditions per place. [2022-01-19 06:11:48,556 INFO L132 encePairwiseOnDemand]: 224/255 looper letters, 453 selfloop transitions, 480 changer transitions 71/1081 dead transitions. [2022-01-19 06:11:48,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1081 transitions, 11256 flow [2022-01-19 06:11:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-01-19 06:11:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2022-01-19 06:11:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 16740 transitions. [2022-01-19 06:11:48,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5861344537815126 [2022-01-19 06:11:48,569 INFO L72 ComplementDD]: Start complementDD. Operand 112 states and 16740 transitions. [2022-01-19 06:11:48,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 16740 transitions. [2022-01-19 06:11:48,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:48,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 112 states and 16740 transitions. [2022-01-19 06:11:48,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 113 states, 112 states have (on average 149.46428571428572) internal successors, (16740), 112 states have internal predecessors, (16740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:48,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 113 states, 113 states have (on average 255.0) internal successors, (28815), 113 states have internal predecessors, (28815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:48,612 INFO L81 ComplementDD]: Finished complementDD. Result has 113 states, 113 states have (on average 255.0) internal successors, (28815), 113 states have internal predecessors, (28815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:48,613 INFO L186 Difference]: Start difference. First operand has 330 places, 432 transitions, 3177 flow. Second operand 112 states and 16740 transitions. [2022-01-19 06:11:48,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1081 transitions, 11256 flow [2022-01-19 06:11:48,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 1081 transitions, 10909 flow, removed 130 selfloop flow, removed 8 redundant places. [2022-01-19 06:11:48,721 INFO L242 Difference]: Finished difference. Result has 500 places, 699 transitions, 7244 flow [2022-01-19 06:11:48,721 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=7244, PETRI_PLACES=500, PETRI_TRANSITIONS=699} [2022-01-19 06:11:48,723 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 291 predicate places. [2022-01-19 06:11:48,723 INFO L470 AbstractCegarLoop]: Abstraction has has 500 places, 699 transitions, 7244 flow [2022-01-19 06:11:48,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 146.7659574468085) internal successors, (6898), 47 states have internal predecessors, (6898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:48,724 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:48,724 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:11:48,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:11:48,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 06:11:48,939 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1244501410, now seen corresponding path program 2 times [2022-01-19 06:11:48,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:48,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562034172] [2022-01-19 06:11:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:48,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:49,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562034172] [2022-01-19 06:11:49,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562034172] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359942864] [2022-01-19 06:11:49,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:11:49,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:49,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:11:49,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:11:49,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:11:49,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:11:49,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:11:49,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:49,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:11:50,168 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:11:50,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:11:50,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:11:50,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-19 06:11:50,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:11:50,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:11:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:11:50,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:54,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:56,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:11:57,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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_50|) 0)) is different from false [2022-01-19 06:11:57,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| 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_50|) 0)) is different from false [2022-01-19 06:11:57,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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_50|) 0)) is different from false [2022-01-19 06:11:59,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) is different from false [2022-01-19 06:11:59,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_625) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:12:00,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:12:00,284 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:12:00,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:12:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:12:00,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359942864] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:00,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:00,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:12:00,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236750774] [2022-01-19 06:12:00,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:00,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:12:00,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:12:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1477, Unknown=8, NotChecked=498, Total=2162 [2022-01-19 06:12:00,302 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 255 [2022-01-19 06:12:00,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 699 transitions, 7244 flow. Second operand has 47 states, 47 states have (on average 146.7659574468085) internal successors, (6898), 47 states have internal predecessors, (6898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:00,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:00,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 255 [2022-01-19 06:12:00,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:13,769 WARN L228 SmtUtils]: Spent 12.83s on a formula simplification. DAG size of input: 60 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:19,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_~#cache~0.base| |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|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= .cse0 .cse1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-19 06:12:31,044 WARN L228 SmtUtils]: Spent 11.84s on a formula simplification. DAG size of input: 51 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:47,185 WARN L228 SmtUtils]: Spent 11.68s on a formula simplification. DAG size of input: 56 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:47,663 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |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_50|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:12:48,279 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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_50|) 0)) (= |c_~#cache~0.base| |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|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4))))) is different from false [2022-01-19 06:12:48,748 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_~#cache~0.base| |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|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= .cse0 .cse1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4))))) is different from false [2022-01-19 06:12:49,123 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:12:49,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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_50|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (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| 4)) is different from false [2022-01-19 06:12:49,874 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (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~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:13:02,926 WARN L228 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:13,584 WARN L228 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:43,469 WARN L228 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:57,453 WARN L228 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:03,851 WARN L228 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:08,365 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2022-01-19 06:14:15,368 WARN L228 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:14:27,910 INFO L129 PetriNetUnfolder]: 3772/13350 cut-off events. [2022-01-19 06:14:27,911 INFO L130 PetriNetUnfolder]: For 660353/660561 co-relation queries the response was YES. [2022-01-19 06:14:28,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82603 conditions, 13350 events. 3772/13350 cut-off events. For 660353/660561 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 127275 event pairs, 310 based on Foata normal form. 109/13194 useless extension candidates. Maximal degree in co-relation 82446. Up to 3102 conditions per place. [2022-01-19 06:14:28,177 INFO L132 encePairwiseOnDemand]: 226/255 looper letters, 1180 selfloop transitions, 1095 changer transitions 0/2352 dead transitions. [2022-01-19 06:14:28,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 2352 transitions, 33506 flow [2022-01-19 06:14:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-01-19 06:14:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2022-01-19 06:14:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 24523 transitions. [2022-01-19 06:14:28,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5863940698230512 [2022-01-19 06:14:28,224 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 24523 transitions. [2022-01-19 06:14:28,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 24523 transitions. [2022-01-19 06:14:28,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:14:28,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 24523 transitions. [2022-01-19 06:14:28,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 165 states, 164 states have (on average 149.53048780487805) internal successors, (24523), 164 states have internal predecessors, (24523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:28,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 165 states, 165 states have (on average 255.0) internal successors, (42075), 165 states have internal predecessors, (42075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:28,293 INFO L81 ComplementDD]: Finished complementDD. Result has 165 states, 165 states have (on average 255.0) internal successors, (42075), 165 states have internal predecessors, (42075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:28,294 INFO L186 Difference]: Start difference. First operand has 500 places, 699 transitions, 7244 flow. Second operand 164 states and 24523 transitions. [2022-01-19 06:14:28,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 2352 transitions, 33506 flow [2022-01-19 06:14:29,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 2352 transitions, 30284 flow, removed 1263 selfloop flow, removed 43 redundant places. [2022-01-19 06:14:29,273 INFO L242 Difference]: Finished difference. Result has 687 places, 1642 transitions, 20885 flow [2022-01-19 06:14:29,274 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=6120, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=164, PETRI_FLOW=20885, PETRI_PLACES=687, PETRI_TRANSITIONS=1642} [2022-01-19 06:14:29,274 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 478 predicate places. [2022-01-19 06:14:29,275 INFO L470 AbstractCegarLoop]: Abstraction has has 687 places, 1642 transitions, 20885 flow [2022-01-19 06:14:29,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 146.7659574468085) internal successors, (6898), 47 states have internal predecessors, (6898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:29,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:14:29,276 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:14:29,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-19 06:14:29,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 06:14:29,479 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:14:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:14:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -829996922, now seen corresponding path program 1 times [2022-01-19 06:14:29,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:14:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842148911] [2022-01-19 06:14:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:14:29,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:14:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:14:30,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:14:30,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842148911] [2022-01-19 06:14:30,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842148911] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:14:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32088394] [2022-01-19 06:14:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:14:30,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:14:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:14:30,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:14:30,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 06:14:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:30,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:14:30,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:14:30,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:14:30,722 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:14:30,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:14:30,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:14:30,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-19 06:14:31,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:14:31,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:14:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:14:31,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:14:35,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:14:37,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-19 06:14:39,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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_56|) 0)) is different from false [2022-01-19 06:14:41,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 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_56|) 0)) is different from false [2022-01-19 06:14:43,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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_56|) 0)) is different from false [2022-01-19 06:14:45,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) is different from false [2022-01-19 06:14:45,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_721) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:14:45,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:14:45,822 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:14:45,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:14:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:14:45,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32088394] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:14:45,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:14:45,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:14:45,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773363531] [2022-01-19 06:14:45,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:14:45,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:14:45,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:14:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:14:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1476, Unknown=8, NotChecked=498, Total=2162 [2022-01-19 06:14:45,840 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 255 [2022-01-19 06:14:45,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 1642 transitions, 20885 flow. Second operand has 47 states, 47 states have (on average 146.82978723404256) internal successors, (6901), 47 states have internal predecessors, (6901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:45,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:14:45,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 255 [2022-01-19 06:14:45,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:15:02,004 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:14,042 WARN L228 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:30,080 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:42,152 WARN L228 SmtUtils]: Spent 9.70s on a formula simplification. DAG size of input: 57 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:48,615 WARN L228 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:49,040 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (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_56|) 0)) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:15:58,580 WARN L228 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:59,397 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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_56|) 0)))) is different from false [2022-01-19 06:15:59,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:16:08,831 WARN L228 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:19,856 WARN L228 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:20,478 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |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_56|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:16:26,004 WARN L228 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:26,331 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (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| 4) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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_56|) 0))) is different from false [2022-01-19 06:16:26,840 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (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~post38#1|) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:16:42,968 WARN L228 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:44,345 INFO L129 PetriNetUnfolder]: 4325/14978 cut-off events. [2022-01-19 06:16:44,346 INFO L130 PetriNetUnfolder]: For 1295367/1295492 co-relation queries the response was YES. [2022-01-19 06:16:44,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113810 conditions, 14978 events. 4325/14978 cut-off events. For 1295367/1295492 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 143923 event pairs, 437 based on Foata normal form. 56/14750 useless extension candidates. Maximal degree in co-relation 113597. Up to 5988 conditions per place. [2022-01-19 06:16:44,802 INFO L132 encePairwiseOnDemand]: 226/255 looper letters, 1339 selfloop transitions, 801 changer transitions 0/2217 dead transitions. [2022-01-19 06:16:44,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 2217 transitions, 36995 flow [2022-01-19 06:16:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-01-19 06:16:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-01-19 06:16:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 13857 transitions. [2022-01-19 06:16:44,812 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5843137254901961 [2022-01-19 06:16:44,812 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 13857 transitions. [2022-01-19 06:16:44,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 13857 transitions. [2022-01-19 06:16:44,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:16:44,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 13857 transitions. [2022-01-19 06:16:44,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 149.0) internal successors, (13857), 93 states have internal predecessors, (13857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:44,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 255.0) internal successors, (23970), 94 states have internal predecessors, (23970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:44,845 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 255.0) internal successors, (23970), 94 states have internal predecessors, (23970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:44,846 INFO L186 Difference]: Start difference. First operand has 687 places, 1642 transitions, 20885 flow. Second operand 93 states and 13857 transitions. [2022-01-19 06:16:44,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 2217 transitions, 36995 flow [2022-01-19 06:16:46,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 2217 transitions, 34650 flow, removed 1076 selfloop flow, removed 25 redundant places. [2022-01-19 06:16:46,961 INFO L242 Difference]: Finished difference. Result has 802 places, 1962 transitions, 26163 flow [2022-01-19 06:16:46,963 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=18778, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=26163, PETRI_PLACES=802, PETRI_TRANSITIONS=1962} [2022-01-19 06:16:46,963 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 593 predicate places. [2022-01-19 06:16:46,963 INFO L470 AbstractCegarLoop]: Abstraction has has 802 places, 1962 transitions, 26163 flow [2022-01-19 06:16:46,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 146.82978723404256) internal successors, (6901), 47 states have internal predecessors, (6901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:46,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:16:46,964 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:16:46,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 06:16:47,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 06:16:47,181 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:16:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:16:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1362737384, now seen corresponding path program 2 times [2022-01-19 06:16:47,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:16:47,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502689526] [2022-01-19 06:16:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:16:47,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:16:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:16:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:16:47,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:16:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502689526] [2022-01-19 06:16:47,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502689526] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:16:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265403941] [2022-01-19 06:16:47,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:16:47,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:16:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:16:47,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:16:47,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 06:16:48,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:16:48,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:16:48,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:16:48,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:16:48,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:16:48,344 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:16:48,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:16:48,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:16:48,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-01-19 06:16:48,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:17:06,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-01-19 06:17:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:17:06,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:16,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) is different from false [2022-01-19 06:17:19,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) is different from false [2022-01-19 06:17:20,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|~#cache~0.offset| Int) (v_ArrVal_820 Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 1) v_ArrVal_820) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28))) is different from false [2022-01-19 06:17:20,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_817 (Array Int Int)) (|~#cache~0.offset| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_817) |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 1) v_ArrVal_820) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28))) 0))) is different from false [2022-01-19 06:17:25,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:17:25,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-01-19 06:17:25,778 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:17:25,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:17:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 9 not checked. [2022-01-19 06:17:25,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265403941] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:25,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:25,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 45 [2022-01-19 06:17:25,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220136090] [2022-01-19 06:17:25,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:25,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-19 06:17:25,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-19 06:17:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1435, Unknown=20, NotChecked=324, Total=1980 [2022-01-19 06:17:25,794 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 255 [2022-01-19 06:17:25,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 1962 transitions, 26163 flow. Second operand has 45 states, 45 states have (on average 152.55555555555554) internal successors, (6865), 45 states have internal predecessors, (6865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:25,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:25,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 255 [2022-01-19 06:17:25,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:32,359 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|~#cache~0.offset| Int) (v_ArrVal_820 Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 1) v_ArrVal_820) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62_113| 28))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (= (select |c_#valid| 4) 1) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:17:45,043 WARN L228 SmtUtils]: Spent 9.73s on a formula simplification. DAG size of input: 66 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:17:46,419 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse5 .cse0)) (.cse2 (@diff .cse1 .cse0)) (.cse4 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (or (<= .cse3 .cse4) (= .cse0 .cse5)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse6) (= .cse0 (store .cse5 .cse3 0)) (or (= .cse0 .cse1) (<= .cse2 .cse4)) (exists ((v_ArrVal_819 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_819))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-19 06:17:47,210 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) .cse0 (exists ((v_ArrVal_819 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_819))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (or (and .cse0 (= .cse1 .cse2)) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) .cse0 (<= .cse3 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:17:48,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_819 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_819))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:17:48,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| Int) (v_ArrVal_820 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_820)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60_117|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_819 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_819))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (<= .cse2 (* |c_ULTIMATE.start_main_~i~3#1| 4)) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-19 06:18:44,843 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60|) 0))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_820 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_820) (select |c_#memory_int| |c_~#cache~0.base|)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| Int) (|aux_mod_~#cache~0.offset_105| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_div_~#cache~0.offset_105| Int) (v_ArrVal_820 Int)) (and (< |aux_mod_~#cache~0.offset_105| 28) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |aux_div_~#cache~0.offset_105|) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (= (store ((as const (Array Int Int)) 0) (+ (* (- 28) |aux_div_~#cache~0.offset_105|) (* (- 1) |aux_mod_~#cache~0.offset_105|) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_820) (select |c_#memory_int| 4)) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= 0 |aux_mod_~#cache~0.offset_105|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:19:08,343 INFO L129 PetriNetUnfolder]: 5273/18822 cut-off events. [2022-01-19 06:19:08,344 INFO L130 PetriNetUnfolder]: For 1615700/1616027 co-relation queries the response was YES. [2022-01-19 06:19:08,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146063 conditions, 18822 events. 5273/18822 cut-off events. For 1615700/1616027 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 188354 event pairs, 103 based on Foata normal form. 158/18594 useless extension candidates. Maximal degree in co-relation 145802. Up to 6400 conditions per place. [2022-01-19 06:19:08,817 INFO L132 encePairwiseOnDemand]: 227/255 looper letters, 1606 selfloop transitions, 891 changer transitions 0/2792 dead transitions. [2022-01-19 06:19:08,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 2792 transitions, 44900 flow [2022-01-19 06:19:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-19 06:19:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-01-19 06:19:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 9586 transitions. [2022-01-19 06:19:08,839 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6063251106894371 [2022-01-19 06:19:08,839 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 9586 transitions. [2022-01-19 06:19:08,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 9586 transitions. [2022-01-19 06:19:08,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:19:08,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 9586 transitions. [2022-01-19 06:19:08,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 154.61290322580646) internal successors, (9586), 62 states have internal predecessors, (9586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:08,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 255.0) internal successors, (16065), 63 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:08,870 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 255.0) internal successors, (16065), 63 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:08,870 INFO L186 Difference]: Start difference. First operand has 802 places, 1962 transitions, 26163 flow. Second operand 62 states and 9586 transitions. [2022-01-19 06:19:08,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 2792 transitions, 44900 flow [2022-01-19 06:19:11,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 2792 transitions, 43858 flow, removed 412 selfloop flow, removed 33 redundant places. [2022-01-19 06:19:11,843 INFO L242 Difference]: Finished difference. Result has 856 places, 2512 transitions, 37019 flow [2022-01-19 06:19:11,844 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=25314, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=37019, PETRI_PLACES=856, PETRI_TRANSITIONS=2512} [2022-01-19 06:19:11,845 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 647 predicate places. [2022-01-19 06:19:11,845 INFO L470 AbstractCegarLoop]: Abstraction has has 856 places, 2512 transitions, 37019 flow [2022-01-19 06:19:11,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 152.55555555555554) internal successors, (6865), 45 states have internal predecessors, (6865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:11,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:19:11,846 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:19:11,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-19 06:19:12,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 06:19:12,049 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:19:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:19:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1409666680, now seen corresponding path program 1 times [2022-01-19 06:19:12,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:19:12,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939836108] [2022-01-19 06:19:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:19:12,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:19:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:19:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:19:12,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:19:12,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939836108] [2022-01-19 06:19:12,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939836108] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:19:12,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098140253] [2022-01-19 06:19:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:19:12,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:19:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:19:12,753 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:19:12,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 06:19:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:19:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 06:19:12,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:19:12,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:19:13,237 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:19:13,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:19:13,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:19:13,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-01-19 06:19:13,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:19:13,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:19:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:19:13,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:19:17,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:19:18,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-01-19 06:19:20,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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_67|) 0)) is different from false [2022-01-19 06:19:20,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 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_67|) 0)) is different from false [2022-01-19 06:19:22,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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_67|) 0)) is different from false [2022-01-19 06:19:24,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-01-19 06:19:24,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_913) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-01-19 06:19:25,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:19:25,106 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:19:25,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:19:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 1 not checked. [2022-01-19 06:19:25,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098140253] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:19:25,119 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:19:25,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2022-01-19 06:19:25,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678189289] [2022-01-19 06:19:25,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:19:25,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 06:19:25,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:19:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 06:19:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1474, Unknown=8, NotChecked=498, Total=2162 [2022-01-19 06:19:25,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 255 [2022-01-19 06:19:25,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 2512 transitions, 37019 flow. Second operand has 47 states, 47 states have (on average 146.89361702127658) internal successors, (6904), 47 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:25,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:19:25,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 255 [2022-01-19 06:19:25,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:19:42,622 WARN L228 SmtUtils]: Spent 16.79s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:50,400 WARN L228 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:50,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 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_67|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:20:06,463 WARN L228 SmtUtils]: Spent 15.52s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:07,305 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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_67|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:20:07,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-01-19 06:20:23,705 WARN L228 SmtUtils]: Spent 13.78s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:24,441 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 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_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:20:37,504 WARN L228 SmtUtils]: Spent 12.92s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:44,189 WARN L228 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:44,549 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (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| 4)) is different from false [2022-01-19 06:20:45,135 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (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~post38#1|) (= |c_~#cache~0.base| 4)) is different from false [2022-01-19 06:21:03,343 WARN L228 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:21:16,750 WARN L228 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:21:20,726 INFO L129 PetriNetUnfolder]: 6713/23803 cut-off events. [2022-01-19 06:21:20,726 INFO L130 PetriNetUnfolder]: For 2123396/2123824 co-relation queries the response was YES. [2022-01-19 06:21:21,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192082 conditions, 23803 events. 6713/23803 cut-off events. For 2123396/2123824 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 251766 event pairs, 716 based on Foata normal form. 202/23501 useless extension candidates. Maximal degree in co-relation 191795. Up to 5710 conditions per place. [2022-01-19 06:21:21,348 INFO L132 encePairwiseOnDemand]: 224/255 looper letters, 1678 selfloop transitions, 1963 changer transitions 0/3718 dead transitions. [2022-01-19 06:21:21,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 3718 transitions, 67207 flow [2022-01-19 06:21:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-19 06:21:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2022-01-19 06:21:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 15619 transitions. [2022-01-19 06:21:21,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5889517345399699 [2022-01-19 06:21:21,356 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 15619 transitions. [2022-01-19 06:21:21,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 15619 transitions. [2022-01-19 06:21:21,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:21,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 15619 transitions. [2022-01-19 06:21:21,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 150.18269230769232) internal successors, (15619), 104 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 255.0) internal successors, (26775), 105 states have internal predecessors, (26775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,383 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 255.0) internal successors, (26775), 105 states have internal predecessors, (26775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,383 INFO L186 Difference]: Start difference. First operand has 856 places, 2512 transitions, 37019 flow. Second operand 104 states and 15619 transitions. [2022-01-19 06:21:21,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 3718 transitions, 67207 flow [2022-01-19 06:21:26,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 3718 transitions, 65475 flow, removed 775 selfloop flow, removed 25 redundant places. [2022-01-19 06:21:26,679 INFO L242 Difference]: Finished difference. Result has 987 places, 3240 transitions, 54779 flow [2022-01-19 06:21:26,681 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=36004, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=54779, PETRI_PLACES=987, PETRI_TRANSITIONS=3240} [2022-01-19 06:21:26,681 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 778 predicate places. [2022-01-19 06:21:26,681 INFO L470 AbstractCegarLoop]: Abstraction has has 987 places, 3240 transitions, 54779 flow [2022-01-19 06:21:26,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 146.89361702127658) internal successors, (6904), 47 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:26,682 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:26,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:26,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:26,898 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1621685580, now seen corresponding path program 2 times [2022-01-19 06:21:26,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:26,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698080079] [2022-01-19 06:21:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:26,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:27,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698080079] [2022-01-19 06:21:27,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698080079] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:27,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119528253] [2022-01-19 06:21:27,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:27,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:27,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 06:21:27,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:27,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:27,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:21:27,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:27,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:21:28,036 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:28,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:21:28,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:21:28,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-01-19 06:21:28,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 06:21:44,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-01-19 06:21:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:44,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:53,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (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_1013)) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0))) is different from false [2022-01-19 06:21:55,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1013)) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-01-19 06:21:55,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|~#cache~0.offset| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 1) v_ArrVal_1013) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-01-19 06:21:56,151 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|~#cache~0.offset| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 1) v_ArrVal_1013) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-01-19 06:22:00,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:22:00,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-01-19 06:22:01,023 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:01,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-01-19 06:22:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 10 not checked. [2022-01-19 06:22:01,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119528253] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:01,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:01,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 45 [2022-01-19 06:22:01,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964878543] [2022-01-19 06:22:01,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:01,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-19 06:22:01,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-19 06:22:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1433, Unknown=20, NotChecked=324, Total=1980 [2022-01-19 06:22:01,040 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 255 [2022-01-19 06:22:01,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 3240 transitions, 54779 flow. Second operand has 45 states, 45 states have (on average 152.62222222222223) internal successors, (6868), 45 states have internal predecessors, (6868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:01,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:01,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 255 [2022-01-19 06:22:01,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:19,037 WARN L228 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 66 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:22:20,078 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (@diff .cse4 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (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_1013)) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse3) (exists ((v_ArrVal_1010 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1010) (select |c_#memory_int| |c_~#cache~0.base|))) (= .cse0 (store .cse4 .cse5 0)) (or (<= .cse2 0) (= .cse0 .cse1)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (= (select |c_#valid| 4) 1) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse4) (<= .cse5 0)) (= |c_~#cache~0.base| 4)))) is different from false [2022-01-19 06:22:20,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1013 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (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_1013)) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0))) .cse0 (exists ((v_ArrVal_1010 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1010) (select |c_#memory_int| |c_~#cache~0.base|))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (or (and .cse0 (= .cse1 .cse2)) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) .cse0 (<= .cse3 0))))) (= |c_~#cache~0.base| 4))) is different from false Received shutdown request... [2022-01-19 06:22:28,589 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:22:28,614 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:22:29,027 WARN L244 SmtUtils]: Removed 7 from assertion stack [2022-01-19 06:22:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:22:29,028 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:22:29,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:29,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 06:22:29,229 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 64 for 1357ms.. [2022-01-19 06:22:29,230 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:22:29,231 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:22:29,231 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:22:29,233 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:29,233 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 06:22:29,236 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:22:29,236 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:22:29,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:22:29,236 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 06:22:29,236 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:22:29,236 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 06:22:29,236 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 06:22:29,237 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 06:22:29,237 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:22:29,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:22:29 BasicIcfg [2022-01-19 06:22:29,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:22:29,239 INFO L158 Benchmark]: Toolchain (without parser) took 848067.37ms. Allocated memory was 343.9MB in the beginning and 3.5GB in the end (delta: 3.1GB). Free memory was 288.4MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2022-01-19 06:22:29,239 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 343.9MB. Free memory was 307.2MB in the beginning and 307.2MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:22:29,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.65ms. Allocated memory was 343.9MB in the beginning and 448.8MB in the end (delta: 104.9MB). Free memory was 288.2MB in the beginning and 403.0MB in the end (delta: -114.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 06:22:29,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.62ms. Allocated memory is still 448.8MB. Free memory was 403.0MB in the beginning and 399.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 06:22:29,239 INFO L158 Benchmark]: Boogie Preprocessor took 45.77ms. Allocated memory is still 448.8MB. Free memory was 399.8MB in the beginning and 397.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:22:29,239 INFO L158 Benchmark]: RCFGBuilder took 402.09ms. Allocated memory is still 448.8MB. Free memory was 396.7MB in the beginning and 376.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-19 06:22:29,240 INFO L158 Benchmark]: TraceAbstraction took 847050.92ms. Allocated memory was 448.8MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 375.7MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2022-01-19 06:22:29,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 343.9MB. Free memory was 307.2MB in the beginning and 307.2MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 503.65ms. Allocated memory was 343.9MB in the beginning and 448.8MB in the end (delta: 104.9MB). Free memory was 288.2MB in the beginning and 403.0MB in the end (delta: -114.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.62ms. Allocated memory is still 448.8MB. Free memory was 403.0MB in the beginning and 399.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.77ms. Allocated memory is still 448.8MB. Free memory was 399.8MB in the beginning and 397.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 402.09ms. Allocated memory is still 448.8MB. Free memory was 396.7MB in the beginning and 376.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 847050.92ms. Allocated memory was 448.8MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 375.7MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 64 for 1357ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 64 for 1357ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 64 for 1357ms.. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 846.9s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 687.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9814 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9814 mSDsluCounter, 11480 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8787 IncrementalHoareTripleChecker+Unchecked, 10941 mSDsCounter, 912 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7751 IncrementalHoareTripleChecker+Invalid, 17450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 912 mSolverCounterUnsat, 568 mSDtfsCounter, 7751 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4133 GetRequests, 2989 SyntacticMatches, 67 SemanticMatches, 1076 ConstructedPredicates, 82 IntricatePredicates, 38 DeprecatedPredicates, 36899 ImplicationChecksByTransitivity, 748.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54779occurred in iteration=16, InterpolantAutomatonStates: 739, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 153.7s InterpolantComputationTime, 3442 NumberOfCodeBlocks, 3427 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4888 ConstructedInterpolants, 1102 QuantifiedInterpolants, 80052 SizeOfPredicates, 191 NumberOfNonLiveVariables, 3842 ConjunctsInSsa, 345 ConjunctsInUnsatCore, 44 InterpolantComputations, 5 PerfectInterpolantSequences, 6474/7102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown