/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:42:07,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:42:07,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:42:07,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:42:07,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:42:07,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:42:07,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:42:07,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:42:07,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:42:07,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:42:07,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:42:07,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:42:07,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:42:07,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:42:07,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:42:07,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:42:07,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:42:07,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:42:07,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:42:07,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:42:07,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:42:07,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:42:07,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:42:07,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:42:07,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:42:08,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:42:08,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:42:08,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:42:08,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:42:08,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:42:08,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:42:08,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:42:08,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:42:08,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:42:08,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:42:08,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:42:08,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:42:08,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:42:08,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:42:08,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:42:08,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:42:08,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:42:08,019 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:42:08,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:42:08,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:42:08,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:42:08,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:42:08,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:42:08,021 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:42:08,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:42:08,021 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:42:08,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:42:08,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:42:08,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:42:08,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:42:08,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:42:08,023 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:42:08,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:42:08,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:42:08,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:42:08,220 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:42:08,220 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:42:08,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-01-28 06:42:09,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:42:09,431 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:42:09,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-01-28 06:42:09,440 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fafbbc2cd/7b3fb4674c3048cbbad006d904568b78/FLAG8ee6260ce [2023-01-28 06:42:09,465 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fafbbc2cd/7b3fb4674c3048cbbad006d904568b78 [2023-01-28 06:42:09,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:42:09,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:42:09,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:42:09,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:42:09,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:42:09,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae5b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09, skipping insertion in model container [2023-01-28 06:42:09,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:42:09,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:42:09,805 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-01-28 06:42:09,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:42:09,820 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:42:09,855 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-01-28 06:42:09,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:42:09,892 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:42:09,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09 WrapperNode [2023-01-28 06:42:09,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:42:09,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:42:09,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:42:09,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:42:09,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,939 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 83 [2023-01-28 06:42:09,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:42:09,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:42:09,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:42:09,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:42:09,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:42:09,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:42:09,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:42:09,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:42:09,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (1/1) ... [2023-01-28 06:42:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:42:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:09,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:42:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:42:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:42:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-28 06:42:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-28 06:42:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:42:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:42:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:42:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:42:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:42:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:42:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:42:10,022 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:42:10,114 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:42:10,115 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:42:10,250 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:42:10,292 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:42:10,292 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 06:42:10,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:42:10 BoogieIcfgContainer [2023-01-28 06:42:10,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:42:10,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:42:10,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:42:10,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:42:10,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:42:09" (1/3) ... [2023-01-28 06:42:10,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdf972d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:42:10, skipping insertion in model container [2023-01-28 06:42:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:42:09" (2/3) ... [2023-01-28 06:42:10,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdf972d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:42:10, skipping insertion in model container [2023-01-28 06:42:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:42:10" (3/3) ... [2023-01-28 06:42:10,305 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-01-28 06:42:10,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:42:10,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 06:42:10,319 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:42:10,374 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:42:10,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,428 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-01-28 06:42:10,428 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:10,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-01-28 06:42:10,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,436 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:42:10,441 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:42:10,467 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-01-28 06:42:10,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:10,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-01-28 06:42:10,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 1170 [2023-01-28 06:42:11,460 INFO L134 LiptonReduction]: Checked pairs total: 1376 [2023-01-28 06:42:11,461 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-01-28 06:42:11,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:42:11,486 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@532361d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:42:11,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-01-28 06:42:11,494 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2023-01-28 06:42:11,494 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:11,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:11,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:11,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:11,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1742846655, now seen corresponding path program 1 times [2023-01-28 06:42:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:11,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293828282] [2023-01-28 06:42:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293828282] [2023-01-28 06:42:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293828282] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:42:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880524463] [2023-01-28 06:42:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:11,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:42:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:42:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:42:11,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 136 [2023-01-28 06:42:11,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:11,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 136 [2023-01-28 06:42:11,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:11,699 INFO L130 PetriNetUnfolder]: 25/64 cut-off events. [2023-01-28 06:42:11,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:11,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 64 events. 25/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 157 event pairs, 19 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 114. Up to 60 conditions per place. [2023-01-28 06:42:11,702 INFO L137 encePairwiseOnDemand]: 133/136 looper letters, 15 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-01-28 06:42:11,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 71 flow [2023-01-28 06:42:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:42:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:42:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2023-01-28 06:42:11,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2023-01-28 06:42:11,712 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 142 transitions. [2023-01-28 06:42:11,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 142 transitions. [2023-01-28 06:42:11,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:11,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 142 transitions. [2023-01-28 06:42:11,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,721 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,722 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 49 flow. Second operand 2 states and 142 transitions. [2023-01-28 06:42:11,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 71 flow [2023-01-28 06:42:11,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 71 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:11,725 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 41 flow [2023-01-28 06:42:11,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=41, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2023-01-28 06:42:11,730 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -2 predicate places. [2023-01-28 06:42:11,730 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 41 flow [2023-01-28 06:42:11,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:11,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:11,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:42:11,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:11,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1803478341, now seen corresponding path program 1 times [2023-01-28 06:42:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369345079] [2023-01-28 06:42:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:11,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369345079] [2023-01-28 06:42:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369345079] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:11,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:11,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:42:11,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593085441] [2023-01-28 06:42:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:11,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:42:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:42:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:42:11,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 136 [2023-01-28 06:42:11,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 41 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:11,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 136 [2023-01-28 06:42:11,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:11,875 INFO L130 PetriNetUnfolder]: 22/61 cut-off events. [2023-01-28 06:42:11,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:11,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 61 events. 22/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 17 based on Foata normal form. 3/57 useless extension candidates. Maximal degree in co-relation 122. Up to 52 conditions per place. [2023-01-28 06:42:11,876 INFO L137 encePairwiseOnDemand]: 134/136 looper letters, 13 selfloop transitions, 0 changer transitions 3/19 dead transitions. [2023-01-28 06:42:11,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 19 transitions, 75 flow [2023-01-28 06:42:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:42:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:42:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2023-01-28 06:42:11,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48284313725490197 [2023-01-28 06:42:11,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2023-01-28 06:42:11,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2023-01-28 06:42:11,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:11,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2023-01-28 06:42:11,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,881 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 41 flow. Second operand 3 states and 197 transitions. [2023-01-28 06:42:11,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 19 transitions, 75 flow [2023-01-28 06:42:11,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 75 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:11,883 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 37 flow [2023-01-28 06:42:11,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2023-01-28 06:42:11,884 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 0 predicate places. [2023-01-28 06:42:11,884 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 37 flow [2023-01-28 06:42:11,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:11,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:11,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:42:11,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:11,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash 961529819, now seen corresponding path program 1 times [2023-01-28 06:42:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345760231] [2023-01-28 06:42:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345760231] [2023-01-28 06:42:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345760231] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:42:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:42:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:42:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307572373] [2023-01-28 06:42:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:42:11,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:42:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:42:11,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:42:11,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 136 [2023-01-28 06:42:11,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 37 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:11,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:11,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 136 [2023-01-28 06:42:11,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:12,044 INFO L130 PetriNetUnfolder]: 33/109 cut-off events. [2023-01-28 06:42:12,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:42:12,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2023-01-28 06:42:12,045 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 22 selfloop transitions, 11 changer transitions 6/41 dead transitions. [2023-01-28 06:42:12,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 41 transitions, 165 flow [2023-01-28 06:42:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:42:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:42:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2023-01-28 06:42:12,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2023-01-28 06:42:12,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 266 transitions. [2023-01-28 06:42:12,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 266 transitions. [2023-01-28 06:42:12,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:12,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 266 transitions. [2023-01-28 06:42:12,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:12,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:12,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:12,056 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 37 flow. Second operand 5 states and 266 transitions. [2023-01-28 06:42:12,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 41 transitions, 165 flow [2023-01-28 06:42:12,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:12,059 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 100 flow [2023-01-28 06:42:12,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-01-28 06:42:12,060 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-01-28 06:42:12,060 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 100 flow [2023-01-28 06:42:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:12,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:12,061 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:42:12,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:42:12,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:12,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2069525911, now seen corresponding path program 1 times [2023-01-28 06:42:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565395211] [2023-01-28 06:42:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565395211] [2023-01-28 06:42:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565395211] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:12,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145050955] [2023-01-28 06:42:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:12,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:12,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 06:42:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:12,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 06:42:12,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:12,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:42:12,580 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:42:12,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 06:42:12,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:42:12,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:42:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:12,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:12,729 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-01-28 06:42:12,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:12,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:42:12,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:12,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:42:12,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-01-28 06:42:12,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:42:12,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:42:12,854 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 28 [2023-01-28 06:42:12,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:42:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 06:42:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145050955] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:42:12,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:42:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-01-28 06:42:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864369719] [2023-01-28 06:42:12,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:42:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 06:42:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 06:42:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2023-01-28 06:42:12,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 136 [2023-01-28 06:42:12,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 100 flow. Second operand has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:12,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:12,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 136 [2023-01-28 06:42:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:13,260 INFO L130 PetriNetUnfolder]: 40/166 cut-off events. [2023-01-28 06:42:13,260 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-01-28 06:42:13,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 166 events. 40/166 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 420 event pairs, 6 based on Foata normal form. 2/168 useless extension candidates. Maximal degree in co-relation 465. Up to 31 conditions per place. [2023-01-28 06:42:13,261 INFO L137 encePairwiseOnDemand]: 127/136 looper letters, 31 selfloop transitions, 17 changer transitions 11/61 dead transitions. [2023-01-28 06:42:13,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 348 flow [2023-01-28 06:42:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 06:42:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 06:42:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 576 transitions. [2023-01-28 06:42:13,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2023-01-28 06:42:13,263 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 576 transitions. [2023-01-28 06:42:13,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 576 transitions. [2023-01-28 06:42:13,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:13,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 576 transitions. [2023-01-28 06:42:13,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 41.142857142857146) internal successors, (576), 14 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:13,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:13,267 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:13,267 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 100 flow. Second operand 14 states and 576 transitions. [2023-01-28 06:42:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 348 flow [2023-01-28 06:42:13,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:42:13,270 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 196 flow [2023-01-28 06:42:13,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=196, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-01-28 06:42:13,270 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2023-01-28 06:42:13,270 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 196 flow [2023-01-28 06:42:13,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:13,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:13,271 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 06:42:13,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 06:42:13,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:13,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:13,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 116172245, now seen corresponding path program 1 times [2023-01-28 06:42:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:13,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360316953] [2023-01-28 06:42:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:14,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360316953] [2023-01-28 06:42:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360316953] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804012120] [2023-01-28 06:42:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:14,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:14,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:14,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 06:42:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:14,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 52 conjunts are in the unsatisfiable core [2023-01-28 06:42:14,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:14,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:42:14,304 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:42:14,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:42:14,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 06:42:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-01-28 06:42:14,402 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:14,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-01-28 06:42:14,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:42:14,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:14,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-01-28 06:42:14,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:14,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-01-28 06:42:14,616 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-01-28 06:42:14,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-01-28 06:42:14,702 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:14,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-01-28 06:42:14,721 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-01-28 06:42:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:14,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:14,834 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-01-28 06:42:15,067 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:15,146 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse1 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse2 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:15,218 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_137 Int) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_137) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_137 Int) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_137) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0) (not (= (+ (select .cse3 0) 1) 0)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:42:15,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:15,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-01-28 06:42:15,480 INFO L321 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2023-01-28 06:42:15,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 295 [2023-01-28 06:42:15,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 198 [2023-01-28 06:42:15,502 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:15,507 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 266 [2023-01-28 06:42:15,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 483 treesize of output 523 [2023-01-28 06:42:15,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 263 [2023-01-28 06:42:15,586 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 06:42:15,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 255 [2023-01-28 06:42:15,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 251 [2023-01-28 06:42:15,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 249 [2023-01-28 06:42:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-01-28 06:42:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804012120] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:42:16,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:42:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2023-01-28 06:42:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521394500] [2023-01-28 06:42:16,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:42:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-28 06:42:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-28 06:42:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=912, Unknown=13, NotChecked=268, Total=1406 [2023-01-28 06:42:16,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-01-28 06:42:16,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 196 flow. Second operand has 38 states, 38 states have (on average 37.23684210526316) internal successors, (1415), 38 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:16,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:16,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-01-28 06:42:16,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:17,128 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77|) 0))))) (and (or (<= c_~next_alloc_idx~0 62) .cse0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| Int)) (or (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77|) 0)))) (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse0) (not (= c_~top~0 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2023-01-28 06:42:17,186 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0)) (<= c_~next_alloc_idx~0 62) (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) is different from false [2023-01-28 06:42:17,218 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse1 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse4 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) .cse6) (<= c_~next_alloc_idx~0 62) (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (or .cse6 (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2023-01-28 06:42:18,857 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse1 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0)))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:18,984 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0)) (or (not (= (+ (select .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)) (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2023-01-28 06:42:19,172 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse1 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse4 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) .cse6) (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (not (= (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse6 (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2023-01-28 06:42:19,721 INFO L130 PetriNetUnfolder]: 96/384 cut-off events. [2023-01-28 06:42:19,721 INFO L131 PetriNetUnfolder]: For 650/650 co-relation queries the response was YES. [2023-01-28 06:42:19,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 384 events. 96/384 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1366 event pairs, 0 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 1398. Up to 106 conditions per place. [2023-01-28 06:42:19,723 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 32 selfloop transitions, 41 changer transitions 114/189 dead transitions. [2023-01-28 06:42:19,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 189 transitions, 1396 flow [2023-01-28 06:42:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-28 06:42:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-01-28 06:42:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 2290 transitions. [2023-01-28 06:42:19,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2806372549019608 [2023-01-28 06:42:19,729 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 2290 transitions. [2023-01-28 06:42:19,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 2290 transitions. [2023-01-28 06:42:19,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:42:19,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 2290 transitions. [2023-01-28 06:42:19,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 38.166666666666664) internal successors, (2290), 60 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:19,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 136.0) internal successors, (8296), 61 states have internal predecessors, (8296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:19,741 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 136.0) internal successors, (8296), 61 states have internal predecessors, (8296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:19,741 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 196 flow. Second operand 60 states and 2290 transitions. [2023-01-28 06:42:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 189 transitions, 1396 flow [2023-01-28 06:42:19,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 189 transitions, 1313 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-28 06:42:19,746 INFO L231 Difference]: Finished difference. Result has 114 places, 58 transitions, 479 flow [2023-01-28 06:42:19,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=479, PETRI_PLACES=114, PETRI_TRANSITIONS=58} [2023-01-28 06:42:19,747 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 92 predicate places. [2023-01-28 06:42:19,747 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 58 transitions, 479 flow [2023-01-28 06:42:19,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 37.23684210526316) internal successors, (1415), 38 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:19,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:42:19,748 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1] [2023-01-28 06:42:19,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 06:42:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:19,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:42:19,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:42:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -533041936, now seen corresponding path program 2 times [2023-01-28 06:42:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:42:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792472147] [2023-01-28 06:42:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:42:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:42:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:42:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:20,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:42:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792472147] [2023-01-28 06:42:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792472147] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:42:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617363148] [2023-01-28 06:42:20,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:42:20,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:42:20,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:42:20,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:42:20,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 06:42:20,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 06:42:20,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:42:20,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 71 conjunts are in the unsatisfiable core [2023-01-28 06:42:20,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:42:20,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:42:20,699 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:42:20,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:42:20,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 06:42:20,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-01-28 06:42:20,773 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:20,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-01-28 06:42:20,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:42:20,862 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:20,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-01-28 06:42:20,925 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:20,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 34 [2023-01-28 06:42:21,034 INFO L321 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-01-28 06:42:21,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 85 [2023-01-28 06:42:21,242 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:21,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 23 treesize of output 29 [2023-01-28 06:42:21,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:21,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-01-28 06:42:21,482 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-01-28 06:42:21,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-01-28 06:42:21,582 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:42:21,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-01-28 06:42:21,605 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-01-28 06:42:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:21,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:21,698 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:21,962 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:22,017 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:42:22,085 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:42:22,329 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse2 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:42:22,461 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse0 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (or (<= c_~next_alloc_idx~0 64) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))))) is different from false [2023-01-28 06:42:22,573 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse0 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:42:22,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:22,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-01-28 06:42:23,055 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:23,060 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 320 [2023-01-28 06:42:23,076 INFO L350 Elim1Store]: Elim1 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 597 treesize of output 581 [2023-01-28 06:42:23,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2023-01-28 06:42:23,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-01-28 06:42:23,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2023-01-28 06:42:23,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:23,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-01-28 06:42:23,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:23,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-01-28 06:42:23,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-01-28 06:42:23,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:42:23,200 INFO L321 Elim1Store]: treesize reduction 42, result has 49.4 percent of original size [2023-01-28 06:42:23,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 109 [2023-01-28 06:42:23,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:23,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 130 [2023-01-28 06:42:23,305 INFO L350 Elim1Store]: Elim1 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 161 treesize of output 153 [2023-01-28 06:42:23,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-01-28 06:42:23,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-01-28 06:42:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2023-01-28 06:42:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617363148] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:42:23,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:42:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2023-01-28 06:42:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982165798] [2023-01-28 06:42:23,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:42:23,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-01-28 06:42:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:42:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-01-28 06:42:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1247, Unknown=17, NotChecked=560, Total=2070 [2023-01-28 06:42:23,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-01-28 06:42:23,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 58 transitions, 479 flow. Second operand has 46 states, 46 states have (on average 37.45652173913044) internal successors, (1723), 46 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:42:23,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:42:23,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-01-28 06:42:23,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:42:25,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:27,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:30,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:32,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:34,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:36,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:40,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:42,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:44,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:46,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:48,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:50,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:42:52,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:42:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:42:56,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:42:58,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:00,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:02,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:04,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:06,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:08,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:10,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:16,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:29,297 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 194 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:43:31,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:35,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:38,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:40,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:42,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:44,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:50,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:52,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:54,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:56,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:43:59,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:01,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:01,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse5 (<= c_~next_alloc_idx~0 64)) (.cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86|) 0))))) (and (or .cse0 (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (not (= c_~top~0 0)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse4) (or .cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))) (or (<= c_~next_alloc_idx~0 60) .cse4) (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86|) 0)) (forall ((v_prenex_79 Int)) (or (= v_prenex_79 |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((v_prenex_81 Int) (v_prenex_83 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| v_prenex_81) v_prenex_79 v_prenex_83) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) .cse5) (or (< 0 (+ c_~next_alloc_idx~0 5)) .cse4))) is different from false [2023-01-28 06:44:03,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:05,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:07,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:09,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:44:09,482 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (forall ((v_prenex_79 Int)) (or (forall ((v_prenex_81 Int) (v_prenex_83 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_81) v_prenex_79 v_prenex_83) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (= v_prenex_79 |c_ULTIMATE.start_main_~#t~0#1.base|))) (or .cse2 (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse5 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (<= c_~next_alloc_idx~0 60) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse2) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (< 0 (+ c_~next_alloc_idx~0 5)))) is different from false [2023-01-28 06:44:09,491 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~next_alloc_idx~0 64)) (.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (forall ((v_prenex_79 Int)) (or (forall ((v_prenex_81 Int) (v_prenex_83 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_81) v_prenex_79 v_prenex_83) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (= v_prenex_79 |c_ULTIMATE.start_main_~#t~0#1.base|))) (or .cse2 (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse5 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or .cse1 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (<= c_~next_alloc_idx~0 60) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse2) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) .cse2) (< 0 (+ c_~next_alloc_idx~0 5)))) is different from false [2023-01-28 06:44:11,251 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (not (= c_~top~0 0)) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))) (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) .cse4) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)))))) is different from false [2023-01-28 06:44:11,263 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64)) (.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or .cse2 (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse5 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse2) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or (not (= (+ (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-01-28 06:44:11,286 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~next_alloc_idx~0 64)) (.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or .cse2 (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse5 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or .cse1 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse2) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (not (= (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) .cse2))) is different from false [2023-01-28 06:44:11,300 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:44:11,312 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:44:11,332 WARN L839 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-01-28 06:44:11,343 WARN L839 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0))))) is different from false [2023-01-28 06:44:11,348 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0))))) is different from false [2023-01-28 06:44:11,353 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0)) (or (not (= (+ (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-01-28 06:44:11,357 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~next_alloc_idx~0 64)) (.cse3 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse4 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or .cse1 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse4) (not (= (select .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) .cse4))) is different from false [2023-01-28 06:44:11,922 INFO L130 PetriNetUnfolder]: 35/211 cut-off events. [2023-01-28 06:44:11,922 INFO L131 PetriNetUnfolder]: For 824/824 co-relation queries the response was YES. [2023-01-28 06:44:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 211 events. 35/211 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 484 event pairs, 4 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 1023. Up to 72 conditions per place. [2023-01-28 06:44:11,923 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 52 selfloop transitions, 69 changer transitions 26/149 dead transitions. [2023-01-28 06:44:11,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 149 transitions, 1555 flow [2023-01-28 06:44:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-28 06:44:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-01-28 06:44:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1920 transitions. [2023-01-28 06:44:11,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2768166089965398 [2023-01-28 06:44:11,928 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 1920 transitions. [2023-01-28 06:44:11,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 1920 transitions. [2023-01-28 06:44:11,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:44:11,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 1920 transitions. [2023-01-28 06:44:11,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 37.64705882352941) internal successors, (1920), 51 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:44:11,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 136.0) internal successors, (7072), 52 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:44:11,938 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 136.0) internal successors, (7072), 52 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:44:11,938 INFO L175 Difference]: Start difference. First operand has 114 places, 58 transitions, 479 flow. Second operand 51 states and 1920 transitions. [2023-01-28 06:44:11,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 149 transitions, 1555 flow [2023-01-28 06:44:11,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 149 transitions, 1419 flow, removed 56 selfloop flow, removed 18 redundant places. [2023-01-28 06:44:11,945 INFO L231 Difference]: Finished difference. Result has 127 places, 92 transitions, 936 flow [2023-01-28 06:44:11,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=936, PETRI_PLACES=127, PETRI_TRANSITIONS=92} [2023-01-28 06:44:11,947 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 105 predicate places. [2023-01-28 06:44:11,947 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 92 transitions, 936 flow [2023-01-28 06:44:11,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 37.45652173913044) internal successors, (1723), 46 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:44:11,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:44:11,948 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1] [2023-01-28 06:44:11,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 06:44:12,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:44:12,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:44:12,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:44:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash -428661417, now seen corresponding path program 3 times [2023-01-28 06:44:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:44:12,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472434089] [2023-01-28 06:44:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:44:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:44:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:44:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:44:12,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:44:12,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472434089] [2023-01-28 06:44:12,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472434089] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:44:12,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515668569] [2023-01-28 06:44:13,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 06:44:13,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:44:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:44:13,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:44:13,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 06:44:13,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-01-28 06:44:13,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:44:13,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 97 conjunts are in the unsatisfiable core [2023-01-28 06:44:13,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:44:13,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:44:13,171 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:44:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:44:13,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:44:13,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-01-28 06:44:13,299 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:44:13,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:44:13,373 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:44:13,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2023-01-28 06:44:13,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-01-28 06:44:13,496 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:44:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-01-28 06:44:13,554 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-01-28 06:44:13,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-01-28 06:44:13,726 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:44:13,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-01-28 06:44:13,831 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:44:13,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 40 treesize of output 46 [2023-01-28 06:44:14,123 INFO L321 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2023-01-28 06:44:14,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 65 treesize of output 117 [2023-01-28 06:44:14,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 06:44:14,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 69 treesize of output 75 [2023-01-28 06:44:14,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:44:14,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2023-01-28 06:44:15,202 INFO L321 Elim1Store]: treesize reduction 200, result has 34.9 percent of original size [2023-01-28 06:44:15,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 98 treesize of output 168 [2023-01-28 06:44:16,069 INFO L321 Elim1Store]: treesize reduction 170, result has 33.6 percent of original size [2023-01-28 06:44:16,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 108 treesize of output 181 [2023-01-28 06:44:18,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-01-28 06:44:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:44:18,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:44:20,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:44:20,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:44:20,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:44:20,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:44:20,921 INFO L321 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2023-01-28 06:44:20,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 26388 treesize of output 26286 [2023-01-28 06:44:21,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1270 treesize of output 1142 [2023-01-28 06:44:21,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:44:21,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2023-01-28 06:44:21,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1173 treesize of output 1153 [2023-01-28 06:44:26,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-01-28 06:44:26,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 125 [2023-01-28 06:44:27,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:44:27,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1768 treesize of output 1722 [2023-01-28 06:44:56,053 WARN L222 SmtUtils]: Spent 25.69s on a formula simplification. DAG size of input: 879 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:44:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 76 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:44:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515668569] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:44:56,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:44:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 57 [2023-01-28 06:44:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380268498] [2023-01-28 06:44:56,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:44:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-28 06:44:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:44:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-28 06:44:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2875, Unknown=26, NotChecked=0, Total=3422 [2023-01-28 06:44:56,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-01-28 06:44:56,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 92 transitions, 936 flow. Second operand has 59 states, 59 states have (on average 37.40677966101695) internal successors, (2207), 59 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:44:56,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:44:56,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-01-28 06:44:56,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:44:58,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:00,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:03,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:05,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:07,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:09,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:11,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:13,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:15,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:17,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:19,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:21,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:23,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:25,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:27,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:29,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:31,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:33,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:35,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:37,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:39,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:41,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:43,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:45,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:47,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:49,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:51,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:53,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:55,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:57,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:45:59,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:01,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:03,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:05,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:07,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:09,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:11,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:13,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:15,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:17,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:20,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:22,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:24,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:26,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:28,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:30,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:32,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:34,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:36,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:39,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:41,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:44,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:46,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:48,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:50,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 06:46:54,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:46:56,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:46:59,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:02,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:04,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:07,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:09,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:12,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:14,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:47:25,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:47:26,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:47:29,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:47:30,287 INFO L130 PetriNetUnfolder]: 10/150 cut-off events. [2023-01-28 06:47:30,287 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2023-01-28 06:47:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 150 events. 10/150 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 245 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 824. Up to 37 conditions per place. [2023-01-28 06:47:30,288 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 0 selfloop transitions, 0 changer transitions 118/118 dead transitions. [2023-01-28 06:47:30,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 118 transitions, 1375 flow [2023-01-28 06:47:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-01-28 06:47:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-01-28 06:47:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1338 transitions. [2023-01-28 06:47:30,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27328431372549017 [2023-01-28 06:47:30,290 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 1338 transitions. [2023-01-28 06:47:30,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 1338 transitions. [2023-01-28 06:47:30,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:30,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 1338 transitions. [2023-01-28 06:47:30,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 37.166666666666664) internal successors, (1338), 36 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:30,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 136.0) internal successors, (5032), 37 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:30,296 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 136.0) internal successors, (5032), 37 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:30,296 INFO L175 Difference]: Start difference. First operand has 127 places, 92 transitions, 936 flow. Second operand 36 states and 1338 transitions. [2023-01-28 06:47:30,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 118 transitions, 1375 flow [2023-01-28 06:47:30,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 118 transitions, 1220 flow, removed 28 selfloop flow, removed 18 redundant places. [2023-01-28 06:47:30,301 INFO L231 Difference]: Finished difference. Result has 142 places, 0 transitions, 0 flow [2023-01-28 06:47:30,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=0, PETRI_PLACES=142, PETRI_TRANSITIONS=0} [2023-01-28 06:47:30,302 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 120 predicate places. [2023-01-28 06:47:30,302 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 0 transitions, 0 flow [2023-01-28 06:47:30,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 37.40677966101695) internal successors, (2207), 59 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:30,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-01-28 06:47:30,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-01-28 06:47:30,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 06:47:30,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:47:30,509 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-01-28 06:47:30,511 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-01-28 06:47:30,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,517 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-01-28 06:47:30,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:30,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-01-28 06:47:30,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,518 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:47:30,518 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-01-28 06:47:30,522 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-01-28 06:47:30,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:30,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-01-28 06:47:30,522 INFO L119 LiptonReduction]: Number of co-enabled transitions 1170 [2023-01-28 06:47:31,373 INFO L134 LiptonReduction]: Checked pairs total: 1309 [2023-01-28 06:47:31,373 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-01-28 06:47:31,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:47:31,374 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@532361d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:47:31,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:47:31,375 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-01-28 06:47:31,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:31,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:31,376 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-01-28 06:47:31,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:47:31,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 54081815, now seen corresponding path program 1 times [2023-01-28 06:47:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919638137] [2023-01-28 06:47:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:47:31,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:47:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:47:31,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:47:31,399 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:47:31,399 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:47:31,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:47:31,399 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:47:31,400 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:47:31,400 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:47:31,400 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 06:47:31,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:47:31,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,432 INFO L130 PetriNetUnfolder]: 13/141 cut-off events. [2023-01-28 06:47:31,432 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:47:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 141 events. 13/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2023-01-28 06:47:31,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,433 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:47:31,433 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,433 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 119 transitions, 250 flow [2023-01-28 06:47:31,442 INFO L130 PetriNetUnfolder]: 13/141 cut-off events. [2023-01-28 06:47:31,442 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:47:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 141 events. 13/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2023-01-28 06:47:31,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 6480 [2023-01-28 06:47:32,420 INFO L134 LiptonReduction]: Checked pairs total: 15292 [2023-01-28 06:47:32,420 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-01-28 06:47:32,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:47:32,421 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@532361d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:47:32,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 06:47:32,423 INFO L130 PetriNetUnfolder]: 1/26 cut-off events. [2023-01-28 06:47:32,423 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 06:47:32,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:32,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:32,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:32,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -757692546, now seen corresponding path program 1 times [2023-01-28 06:47:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017059424] [2023-01-28 06:47:32,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:47:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:32,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017059424] [2023-01-28 06:47:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017059424] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:32,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:47:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453691869] [2023-01-28 06:47:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:32,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:47:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:47:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:47:32,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209 [2023-01-28 06:47:32,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:32,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209 [2023-01-28 06:47:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:32,526 INFO L130 PetriNetUnfolder]: 377/829 cut-off events. [2023-01-28 06:47:32,526 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-01-28 06:47:32,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 829 events. 377/829 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4668 event pairs, 302 based on Foata normal form. 46/764 useless extension candidates. Maximal degree in co-relation 1126. Up to 587 conditions per place. [2023-01-28 06:47:32,530 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 33 selfloop transitions, 1 changer transitions 1/54 dead transitions. [2023-01-28 06:47:32,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 195 flow [2023-01-28 06:47:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:47:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:47:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-01-28 06:47:32,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231259968102073 [2023-01-28 06:47:32,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-01-28 06:47:32,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-01-28 06:47:32,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:32,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-01-28 06:47:32,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,532 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 108 flow. Second operand 3 states and 328 transitions. [2023-01-28 06:47:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 195 flow [2023-01-28 06:47:32,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 193 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-28 06:47:32,533 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 98 flow [2023-01-28 06:47:32,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-01-28 06:47:32,534 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-01-28 06:47:32,535 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 98 flow [2023-01-28 06:47:32,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:32,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:47:32,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:32,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1900018535, now seen corresponding path program 1 times [2023-01-28 06:47:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049641882] [2023-01-28 06:47:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:47:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:32,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049641882] [2023-01-28 06:47:32,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049641882] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:32,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:47:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254958255] [2023-01-28 06:47:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:47:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:47:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:47:32,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 209 [2023-01-28 06:47:32,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:32,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:32,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 209 [2023-01-28 06:47:32,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:32,997 INFO L130 PetriNetUnfolder]: 2503/4507 cut-off events. [2023-01-28 06:47:32,997 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2023-01-28 06:47:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9031 conditions, 4507 events. 2503/4507 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 28476 event pairs, 500 based on Foata normal form. 0/4296 useless extension candidates. Maximal degree in co-relation 8628. Up to 1492 conditions per place. [2023-01-28 06:47:33,014 INFO L137 encePairwiseOnDemand]: 197/209 looper letters, 157 selfloop transitions, 33 changer transitions 0/198 dead transitions. [2023-01-28 06:47:33,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 198 transitions, 825 flow [2023-01-28 06:47:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:47:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:47:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions. [2023-01-28 06:47:33,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44869750132908026 [2023-01-28 06:47:33,016 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 844 transitions. [2023-01-28 06:47:33,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions. [2023-01-28 06:47:33,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:33,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions. [2023-01-28 06:47:33,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:33,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:33,019 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:33,019 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 98 flow. Second operand 9 states and 844 transitions. [2023-01-28 06:47:33,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 198 transitions, 825 flow [2023-01-28 06:47:33,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 198 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:47:33,022 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 349 flow [2023-01-28 06:47:33,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-01-28 06:47:33,023 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-01-28 06:47:33,023 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 349 flow [2023-01-28 06:47:33,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:33,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:33,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:47:33,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:33,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1185009545, now seen corresponding path program 1 times [2023-01-28 06:47:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363266134] [2023-01-28 06:47:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:47:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363266134] [2023-01-28 06:47:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363266134] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:47:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289124886] [2023-01-28 06:47:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:47:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:47:33,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:47:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 06:47:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:33,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 06:47:33,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:47:33,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:47:33,244 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:47:33,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 06:47:33,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:47:33,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:47:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:47:33,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:47:33,346 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_441) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-01-28 06:47:33,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:33,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:47:33,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:33,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:47:33,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-01-28 06:47:33,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:33,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:33,408 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 28 [2023-01-28 06:47:33,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 06:47:33,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289124886] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:47:33,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:47:33,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-01-28 06:47:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312792849] [2023-01-28 06:47:33,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:47:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 06:47:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 06:47:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-01-28 06:47:33,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 209 [2023-01-28 06:47:33,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 349 flow. Second operand has 17 states, 17 states have (on average 64.70588235294117) internal successors, (1100), 17 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:33,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:33,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 209 [2023-01-28 06:47:33,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:35,622 INFO L130 PetriNetUnfolder]: 7446/13326 cut-off events. [2023-01-28 06:47:35,622 INFO L131 PetriNetUnfolder]: For 26272/26272 co-relation queries the response was YES. [2023-01-28 06:47:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42561 conditions, 13326 events. 7446/13326 cut-off events. For 26272/26272 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 101715 event pairs, 877 based on Foata normal form. 210/13216 useless extension candidates. Maximal degree in co-relation 38767. Up to 3560 conditions per place. [2023-01-28 06:47:35,706 INFO L137 encePairwiseOnDemand]: 193/209 looper letters, 563 selfloop transitions, 208 changer transitions 2/780 dead transitions. [2023-01-28 06:47:35,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 780 transitions, 4891 flow [2023-01-28 06:47:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 06:47:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 06:47:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3678 transitions. [2023-01-28 06:47:35,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3666267942583732 [2023-01-28 06:47:35,710 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3678 transitions. [2023-01-28 06:47:35,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3678 transitions. [2023-01-28 06:47:35,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:35,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3678 transitions. [2023-01-28 06:47:35,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 76.625) internal successors, (3678), 48 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:35,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:35,723 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:35,724 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 349 flow. Second operand 48 states and 3678 transitions. [2023-01-28 06:47:35,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 780 transitions, 4891 flow [2023-01-28 06:47:35,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 780 transitions, 4891 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:47:35,752 INFO L231 Difference]: Finished difference. Result has 134 places, 273 transitions, 2435 flow [2023-01-28 06:47:35,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2435, PETRI_PLACES=134, PETRI_TRANSITIONS=273} [2023-01-28 06:47:35,753 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 85 predicate places. [2023-01-28 06:47:35,753 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 273 transitions, 2435 flow [2023-01-28 06:47:35,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.70588235294117) internal successors, (1100), 17 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:35,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:35,754 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:35,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 06:47:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-28 06:47:35,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:35,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -416986568, now seen corresponding path program 1 times [2023-01-28 06:47:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275355022] [2023-01-28 06:47:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:47:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:36,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275355022] [2023-01-28 06:47:36,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275355022] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:36,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:47:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716412793] [2023-01-28 06:47:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:36,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:47:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:47:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:47:36,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 209 [2023-01-28 06:47:36,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 273 transitions, 2435 flow. Second operand has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:36,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:36,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 209 [2023-01-28 06:47:36,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:38,095 INFO L130 PetriNetUnfolder]: 10328/19710 cut-off events. [2023-01-28 06:47:38,095 INFO L131 PetriNetUnfolder]: For 108791/108793 co-relation queries the response was YES. [2023-01-28 06:47:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80368 conditions, 19710 events. 10328/19710 cut-off events. For 108791/108793 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 167431 event pairs, 1457 based on Foata normal form. 292/19687 useless extension candidates. Maximal degree in co-relation 78383. Up to 7067 conditions per place. [2023-01-28 06:47:38,238 INFO L137 encePairwiseOnDemand]: 196/209 looper letters, 575 selfloop transitions, 440 changer transitions 8/1031 dead transitions. [2023-01-28 06:47:38,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1031 transitions, 11173 flow [2023-01-28 06:47:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:47:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:47:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 837 transitions. [2023-01-28 06:47:38,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449760765550239 [2023-01-28 06:47:38,239 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 837 transitions. [2023-01-28 06:47:38,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 837 transitions. [2023-01-28 06:47:38,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:38,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 837 transitions. [2023-01-28 06:47:38,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.0) internal successors, (837), 9 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:38,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:38,242 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:38,242 INFO L175 Difference]: Start difference. First operand has 134 places, 273 transitions, 2435 flow. Second operand 9 states and 837 transitions. [2023-01-28 06:47:38,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1031 transitions, 11173 flow [2023-01-28 06:47:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 1031 transitions, 11045 flow, removed 64 selfloop flow, removed 0 redundant places. [2023-01-28 06:47:38,806 INFO L231 Difference]: Finished difference. Result has 150 places, 683 transitions, 8527 flow [2023-01-28 06:47:38,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8527, PETRI_PLACES=150, PETRI_TRANSITIONS=683} [2023-01-28 06:47:38,806 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 101 predicate places. [2023-01-28 06:47:38,806 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 683 transitions, 8527 flow [2023-01-28 06:47:38,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:38,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:38,807 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:38,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:47:38,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:38,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 572663114, now seen corresponding path program 2 times [2023-01-28 06:47:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230649140] [2023-01-28 06:47:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 06:47:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230649140] [2023-01-28 06:47:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230649140] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:47:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678418812] [2023-01-28 06:47:38,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:47:38,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:47:38,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:47:38,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:47:38,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 06:47:38,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 06:47:38,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:47:38,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 06:47:38,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:47:38,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:47:39,003 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:47:39,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 06:47:39,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:47:39,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:47:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 06:47:39,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:47:39,091 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_495) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-01-28 06:47:39,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:39,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:47:39,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:39,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:47:39,130 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:39,131 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-01-28 06:47:39,137 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 56 [2023-01-28 06:47:39,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:39,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:39,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 06:47:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-01-28 06:47:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678418812] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:47:39,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:47:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-01-28 06:47:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612508125] [2023-01-28 06:47:39,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:47:39,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 06:47:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 06:47:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-01-28 06:47:39,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 209 [2023-01-28 06:47:39,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 683 transitions, 8527 flow. Second operand has 17 states, 17 states have (on average 64.82352941176471) internal successors, (1102), 17 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:39,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:39,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 209 [2023-01-28 06:47:39,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:48,280 INFO L130 PetriNetUnfolder]: 24516/46484 cut-off events. [2023-01-28 06:47:48,280 INFO L131 PetriNetUnfolder]: For 414724/414732 co-relation queries the response was YES. [2023-01-28 06:47:48,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231568 conditions, 46484 events. 24516/46484 cut-off events. For 414724/414732 co-relation queries the response was YES. Maximal size of possible extension queue 1789. Compared 449615 event pairs, 4321 based on Foata normal form. 326/46800 useless extension candidates. Maximal degree in co-relation 225602. Up to 9974 conditions per place. [2023-01-28 06:47:48,776 INFO L137 encePairwiseOnDemand]: 192/209 looper letters, 1391 selfloop transitions, 1406 changer transitions 61/2865 dead transitions. [2023-01-28 06:47:48,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 2865 transitions, 39299 flow [2023-01-28 06:47:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-28 06:47:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-01-28 06:47:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3894 transitions. [2023-01-28 06:47:48,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3653250773993808 [2023-01-28 06:47:48,785 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3894 transitions. [2023-01-28 06:47:48,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3894 transitions. [2023-01-28 06:47:48,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:48,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3894 transitions. [2023-01-28 06:47:48,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 76.3529411764706) internal successors, (3894), 51 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:48,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 209.0) internal successors, (10868), 52 states have internal predecessors, (10868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:48,812 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 209.0) internal successors, (10868), 52 states have internal predecessors, (10868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:48,812 INFO L175 Difference]: Start difference. First operand has 150 places, 683 transitions, 8527 flow. Second operand 51 states and 3894 transitions. [2023-01-28 06:47:48,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 2865 transitions, 39299 flow [2023-01-28 06:47:52,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 2865 transitions, 39115 flow, removed 92 selfloop flow, removed 0 redundant places. [2023-01-28 06:47:52,726 INFO L231 Difference]: Finished difference. Result has 233 places, 1749 transitions, 28003 flow [2023-01-28 06:47:52,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=8455, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=28003, PETRI_PLACES=233, PETRI_TRANSITIONS=1749} [2023-01-28 06:47:52,726 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 184 predicate places. [2023-01-28 06:47:52,726 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1749 transitions, 28003 flow [2023-01-28 06:47:52,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.82352941176471) internal successors, (1102), 17 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:52,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:52,727 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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] [2023-01-28 06:47:52,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 06:47:52,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:47:52,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:47:52,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash 801443805, now seen corresponding path program 1 times [2023-01-28 06:47:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563007135] [2023-01-28 06:47:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:47:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563007135] [2023-01-28 06:47:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563007135] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:47:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384105934] [2023-01-28 06:47:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:53,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:47:53,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:47:53,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:47:53,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 06:47:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:53,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 06:47:53,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:47:53,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:47:53,185 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:47:53,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:47:53,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 06:47:53,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-01-28 06:47:53,293 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:47:53,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 06:47:53,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:47:53,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:47:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:47:53,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:47:53,400 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-01-28 06:47:53,431 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:47:53,504 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))))) is different from false [2023-01-28 06:47:53,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:53,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-01-28 06:47:53,728 INFO L321 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2023-01-28 06:47:53,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 129 [2023-01-28 06:47:53,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2023-01-28 06:47:53,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2023-01-28 06:47:53,742 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:47:53,754 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2023-01-28 06:47:53,758 INFO L350 Elim1Store]: Elim1 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 137 treesize of output 135 [2023-01-28 06:47:53,760 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 06:47:53,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 105 [2023-01-28 06:47:53,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2023-01-28 06:47:53,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2023-01-28 06:47:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-01-28 06:47:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384105934] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:47:54,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:47:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2023-01-28 06:47:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915374708] [2023-01-28 06:47:54,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:47:54,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 06:47:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 06:47:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=347, Unknown=7, NotChecked=120, Total=552 [2023-01-28 06:47:54,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 209 [2023-01-28 06:47:54,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1749 transitions, 28003 flow. Second operand has 24 states, 24 states have (on average 63.625) internal successors, (1527), 24 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:54,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:54,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 209 [2023-01-28 06:47:54,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:55,379 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (forall ((v_prenex_1004 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_prenex_1004) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (<= c_~next_alloc_idx~0 62) (not (= c_~top~0 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:47:55,680 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))))) is different from false [2023-01-28 06:47:57,215 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:47:59,289 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:07,949 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:08,391 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-01-28 06:48:08,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:10,075 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3) (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:10,352 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0))) is different from false [2023-01-28 06:48:12,331 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= (select .cse0 |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2023-01-28 06:48:12,455 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:12,684 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-01-28 06:48:12,738 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| Int)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58|) 0))))) (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (not (= (+ c_~next_alloc_idx~0 2) 0))) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58|) 0)) (forall ((v_prenex_1004 Int)) (not (= (select (store |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| v_prenex_1004) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) (or .cse0 (<= c_~next_alloc_idx~0 62)))) is different from false [2023-01-28 06:48:14,865 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:16,933 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:48:19,808 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-01-28 06:49:10,593 INFO L130 PetriNetUnfolder]: 99489/191129 cut-off events. [2023-01-28 06:49:10,593 INFO L131 PetriNetUnfolder]: For 2304933/2304941 co-relation queries the response was YES. [2023-01-28 06:49:13,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083849 conditions, 191129 events. 99489/191129 cut-off events. For 2304933/2304941 co-relation queries the response was YES. Maximal size of possible extension queue 4838. Compared 2170394 event pairs, 15232 based on Foata normal form. 715/191838 useless extension candidates. Maximal degree in co-relation 1064108. Up to 37343 conditions per place. [2023-01-28 06:49:13,859 INFO L137 encePairwiseOnDemand]: 174/209 looper letters, 5342 selfloop transitions, 7265 changer transitions 347/12961 dead transitions. [2023-01-28 06:49:13,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 12961 transitions, 215558 flow [2023-01-28 06:49:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2023-01-28 06:49:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2023-01-28 06:49:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 15515 transitions. [2023-01-28 06:49:13,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34688995215311 [2023-01-28 06:49:13,871 INFO L72 ComplementDD]: Start complementDD. Operand 214 states and 15515 transitions. [2023-01-28 06:49:13,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 15515 transitions. [2023-01-28 06:49:13,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:13,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 214 states and 15515 transitions. [2023-01-28 06:49:13,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 215 states, 214 states have (on average 72.5) internal successors, (15515), 214 states have internal predecessors, (15515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:13,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 215 states, 215 states have (on average 209.0) internal successors, (44935), 215 states have internal predecessors, (44935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:13,934 INFO L81 ComplementDD]: Finished complementDD. Result has 215 states, 215 states have (on average 209.0) internal successors, (44935), 215 states have internal predecessors, (44935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:13,934 INFO L175 Difference]: Start difference. First operand has 233 places, 1749 transitions, 28003 flow. Second operand 214 states and 15515 transitions. [2023-01-28 06:49:13,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 12961 transitions, 215558 flow [2023-01-28 06:50:53,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 12961 transitions, 213468 flow, removed 1045 selfloop flow, removed 0 redundant places. [2023-01-28 06:50:53,753 INFO L231 Difference]: Finished difference. Result has 572 places, 9132 transitions, 174961 flow [2023-01-28 06:50:53,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=27511, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=214, PETRI_FLOW=174961, PETRI_PLACES=572, PETRI_TRANSITIONS=9132} [2023-01-28 06:50:53,755 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 523 predicate places. [2023-01-28 06:50:53,755 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 9132 transitions, 174961 flow [2023-01-28 06:50:53,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 63.625) internal successors, (1527), 24 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:53,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:53,756 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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] [2023-01-28 06:50:53,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 06:50:53,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:50:53,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:50:53,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash 658954212, now seen corresponding path program 1 times [2023-01-28 06:50:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42159196] [2023-01-28 06:50:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:50:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42159196] [2023-01-28 06:50:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42159196] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:50:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473975722] [2023-01-28 06:50:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:54,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:50:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:50:54,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:50:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 06:50:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:54,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 06:50:54,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:50:54,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-01-28 06:50:54,278 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:50:54,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:50:54,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 06:50:54,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-01-28 06:50:54,369 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:50:54,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 06:50:54,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 06:50:54,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:50:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 06:50:54,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:50:54,479 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-01-28 06:50:54,501 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2023-01-28 06:50:54,577 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)))))) is different from false [2023-01-28 06:50:54,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:50:54,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-01-28 06:50:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2023-01-28 06:50:54,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-01-28 06:50:54,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-01-28 06:50:54,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:50:54,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-01-28 06:50:54,761 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 27 [2023-01-28 06:50:54,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-01-28 06:50:54,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-01-28 06:50:54,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-01-28 06:50:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-01-28 06:50:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473975722] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:50:54,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:50:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2023-01-28 06:50:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854706064] [2023-01-28 06:50:54,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:50:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 06:50:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 06:50:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=387, Unknown=7, NotChecked=126, Total=600 [2023-01-28 06:50:54,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 209 [2023-01-28 06:50:54,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 9132 transitions, 174961 flow. Second operand has 25 states, 25 states have (on average 63.04) internal successors, (1576), 25 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:54,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:54,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 209 [2023-01-28 06:50:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:12,125 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-01-28 06:51:19,148 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-01-28 06:51:24,051 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)))))) is different from false [2023-01-28 06:51:24,225 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:51:51,273 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (<= c_~next_alloc_idx~0 62) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1) (forall ((v_prenex_1021 Int)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_prenex_1021) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) is different from false [2023-01-28 06:52:02,689 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)))))) is different from false [2023-01-28 06:52:22,686 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (= |c_thr1Thread1of2ForFork0_push_#t~mem6#1| 3) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:52:23,481 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1) (not (= |c_thr1Thread1of2ForFork0_push_#t~mem6#1| 0)))) is different from false [2023-01-28 06:52:24,187 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select .cse0 |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)))) is different from false [2023-01-28 06:52:28,017 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-01-28 06:52:38,180 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (= 3 c_~top~0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:52:43,789 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-01-28 06:52:58,428 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_57| Int)) (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_57|) 0))))) (and (or (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_prenex_1021 Int)) (not (= (select (store |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_57| v_prenex_1021) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_57|) 0)))) (or .cse0 (not (= (+ c_~next_alloc_idx~0 2) 0))) (not (= c_~top~0 0)) (or (<= c_~next_alloc_idx~0 62) .cse0) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)))) is different from false [2023-01-28 06:53:41,713 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (= 3 c_~top~0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:53:43,396 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:54:12,187 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false [2023-01-28 06:54:42,407 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse0) (not (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse1 (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 Int) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_609) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0))))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_610 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_610) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_613) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_60|) 0)))) .cse1))) is different from false Received shutdown request... [2023-01-28 06:55:43,851 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:55:43,851 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:55:44,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-28 06:55:45,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-01-28 06:55:48,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 06:55:48,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:55:48,251 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 06:55:48,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 06:55:48,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 06:55:48,251 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-01-28 06:55:48,252 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 06:55:48,252 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-01-28 06:55:48,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:55:48,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:55:48 BasicIcfg [2023-01-28 06:55:48,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:55:48,255 INFO L158 Benchmark]: Toolchain (without parser) took 818787.13ms. Allocated memory was 429.9MB in the beginning and 11.9GB in the end (delta: 11.5GB). Free memory was 397.9MB in the beginning and 6.7GB in the end (delta: -6.3GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-01-28 06:55:48,255 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:55:48,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.55ms. Allocated memory is still 429.9MB. Free memory was 397.9MB in the beginning and 378.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 06:55:48,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.46ms. Allocated memory is still 429.9MB. Free memory was 378.5MB in the beginning and 376.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:55:48,255 INFO L158 Benchmark]: Boogie Preprocessor took 24.58ms. Allocated memory is still 429.9MB. Free memory was 376.4MB in the beginning and 374.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:55:48,255 INFO L158 Benchmark]: RCFGBuilder took 322.82ms. Allocated memory is still 429.9MB. Free memory was 374.6MB in the beginning and 358.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-01-28 06:55:48,256 INFO L158 Benchmark]: TraceAbstraction took 817954.00ms. Allocated memory was 429.9MB in the beginning and 11.9GB in the end (delta: 11.5GB). Free memory was 357.5MB in the beginning and 6.7GB in the end (delta: -6.3GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-01-28 06:55:48,256 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 424.55ms. Allocated memory is still 429.9MB. Free memory was 397.9MB in the beginning and 378.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.46ms. Allocated memory is still 429.9MB. Free memory was 378.5MB in the beginning and 376.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.58ms. Allocated memory is still 429.9MB. Free memory was 376.4MB in the beginning and 374.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 322.82ms. Allocated memory is still 429.9MB. Free memory was 374.6MB in the beginning and 358.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 817954.00ms. Allocated memory was 429.9MB in the beginning and 11.9GB in the end (delta: 11.5GB). Free memory was 357.5MB in the beginning and 6.7GB in the end (delta: -6.3GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 70 PlacesBefore, 22 PlacesAfterwards, 73 TransitionsBefore, 22 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 63 TotalNumberOfCompositions, 1376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 989, independent: 909, independent conditional: 0, independent unconditional: 909, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 608, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 989, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 608, unknown conditional: 0, unknown unconditional: 608] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 70 PlacesBefore, 22 PlacesAfterwards, 73 TransitionsBefore, 22 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 63 TotalNumberOfCompositions, 1309 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 892, independent: 811, independent conditional: 0, independent unconditional: 811, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 605, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 892, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 605, unknown conditional: 0, unknown unconditional: 605] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 113 PlacesBefore, 49 PlacesAfterwards, 119 TransitionsBefore, 48 TransitionsAfterwards, 6480 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 7 ChoiceCompositions, 90 TotalNumberOfCompositions, 15292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6995, independent: 6658, independent conditional: 0, independent unconditional: 6658, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3349, independent: 3284, independent conditional: 0, independent unconditional: 3284, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6995, independent: 3374, independent conditional: 0, independent unconditional: 3374, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 3349, unknown conditional: 0, unknown unconditional: 3349] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 303, Positive conditional cache size: 0, Positive unconditional cache size: 303, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 109 locations, 3 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: 320.1s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 266.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 191 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 218.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 217.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2891 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2918 IncrementalHoareTripleChecker+Invalid, 6384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 2 mSDtfsCounter, 2918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 187 SyntacticMatches, 34 SemanticMatches, 290 ConstructedPredicates, 31 IntricatePredicates, 1 DeprecatedPredicates, 6117 ImplicationChecksByTransitivity, 78.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=936occurred in iteration=6, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 51.5s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 440 ConstructedInterpolants, 180 QuantifiedInterpolants, 17597 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 0/525 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 150 locations, 4 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: 496.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 492.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 422 mSolverCounterUnknown, 4883 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4883 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18354 IncrementalHoareTripleChecker+Unchecked, 859 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12774 IncrementalHoareTripleChecker+Invalid, 31983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 112 mSDtfsCounter, 12774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 228 SyntacticMatches, 35 SemanticMatches, 522 ConstructedPredicates, 41 IntricatePredicates, 1 DeprecatedPredicates, 33867 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174961occurred in iteration=6, InterpolantAutomatonStates: 334, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 415 ConstructedInterpolants, 96 QuantifiedInterpolants, 6243 SizeOfPredicates, 47 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 26/59 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, 109 locations, 3 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.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown