/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 21:56:09,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 21:56:09,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 21:56:10,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 21:56:10,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 21:56:10,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 21:56:10,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 21:56:10,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 21:56:10,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 21:56:10,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 21:56:10,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 21:56:10,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 21:56:10,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 21:56:10,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 21:56:10,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 21:56:10,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 21:56:10,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 21:56:10,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 21:56:10,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 21:56:10,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 21:56:10,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 21:56:10,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 21:56:10,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 21:56:10,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 21:56:10,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 21:56:10,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 21:56:10,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 21:56:10,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 21:56:10,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 21:56:10,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 21:56:10,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 21:56:10,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 21:56:10,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 21:56:10,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 21:56:10,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 21:56:10,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 21:56:10,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 21:56:10,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 21:56:10,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 21:56:10,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 21:56:10,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 21:56:10,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 21:56:10,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 21:56:10,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 21:56:10,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 21:56:10,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 21:56:10,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 21:56:10,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 21:56:10,073 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 21:56:10,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 21:56:10,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 21:56:10,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 21:56:10,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 21:56:10,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 21:56:10,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 21:56:10,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 21:56:10,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 21:56:10,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 21:56:10,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 21:56:10,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 21:56:10,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 21:56:10,076 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 21:56:10,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 21:56:10,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 21:56:10,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 21:56:10,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 21:56:10,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 21:56:10,272 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 21:56:10,273 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 21:56:10,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-01-18 21:56:10,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de326f78/c2f5234d032749448cd064b3ab571e9f/FLAG7655e59ea [2022-01-18 21:56:10,752 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 21:56:10,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-01-18 21:56:10,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de326f78/c2f5234d032749448cd064b3ab571e9f/FLAG7655e59ea [2022-01-18 21:56:10,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de326f78/c2f5234d032749448cd064b3ab571e9f [2022-01-18 21:56:10,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 21:56:10,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 21:56:10,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 21:56:10,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 21:56:10,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 21:56:10,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:56:10" (1/1) ... [2022-01-18 21:56:10,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fbbd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:10, skipping insertion in model container [2022-01-18 21:56:10,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:56:10" (1/1) ... [2022-01-18 21:56:10,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 21:56:10,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 21:56:11,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-01-18 21:56:11,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 21:56:11,201 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 21:56:11,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-01-18 21:56:11,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 21:56:11,260 INFO L208 MainTranslator]: Completed translation [2022-01-18 21:56:11,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11 WrapperNode [2022-01-18 21:56:11,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 21:56:11,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 21:56:11,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 21:56:11,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 21:56:11,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,290 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-01-18 21:56:11,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 21:56:11,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 21:56:11,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 21:56:11,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 21:56:11,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 21:56:11,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 21:56:11,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 21:56:11,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 21:56:11,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (1/1) ... [2022-01-18 21:56:11,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 21:56:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:56:11,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 21:56:11,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 21:56:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-18 21:56:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-18 21:56:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 21:56:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 21:56:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 21:56:11,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 21:56:11,366 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 21:56:11,496 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 21:56:11,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 21:56:11,692 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 21:56:11,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 21:56:11,697 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-18 21:56:11,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:56:11 BoogieIcfgContainer [2022-01-18 21:56:11,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 21:56:11,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 21:56:11,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 21:56:11,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 21:56:11,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:56:10" (1/3) ... [2022-01-18 21:56:11,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667d73ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:56:11, skipping insertion in model container [2022-01-18 21:56:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:56:11" (2/3) ... [2022-01-18 21:56:11,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667d73ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:56:11, skipping insertion in model container [2022-01-18 21:56:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:56:11" (3/3) ... [2022-01-18 21:56:11,714 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-01-18 21:56:11,717 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 21:56:11,717 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 21:56:11,717 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 21:56:11,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,757 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,758 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,768 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,769 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,790 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,790 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,791 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,791 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,792 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,792 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,793 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,793 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,793 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,793 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,793 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,794 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,794 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,794 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,794 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,794 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,795 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,818 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:56:11,820 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 21:56:11,846 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 21:56:11,850 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 21:56:11,850 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 21:56:11,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2022-01-18 21:56:11,896 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2022-01-18 21:56:11,896 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-18 21:56:11,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 10/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-01-18 21:56:11,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 176 transitions, 368 flow [2022-01-18 21:56:11,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 164 transitions, 337 flow [2022-01-18 21:56:11,930 INFO L129 PetriNetUnfolder]: 5/130 cut-off events. [2022-01-18 21:56:11,930 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-18 21:56:11,930 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:11,931 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:11,931 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-01-18 21:56:11,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496448244] [2022-01-18 21:56:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:11,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:12,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:12,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496448244] [2022-01-18 21:56:12,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496448244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:12,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:12,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 21:56:12,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283072151] [2022-01-18 21:56:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:12,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 21:56:12,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:12,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 21:56:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 21:56:12,188 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-18 21:56:12,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:12,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-18 21:56:12,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:12,302 INFO L129 PetriNetUnfolder]: 88/703 cut-off events. [2022-01-18 21:56:12,302 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-18 21:56:12,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 703 events. 88/703 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3125 event pairs, 32 based on Foata normal form. 69/706 useless extension candidates. Maximal degree in co-relation 747. Up to 111 conditions per place. [2022-01-18 21:56:12,309 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2022-01-18 21:56:12,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 385 flow [2022-01-18 21:56:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 21:56:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 21:56:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-01-18 21:56:12,323 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9299242424242424 [2022-01-18 21:56:12,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-01-18 21:56:12,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-01-18 21:56:12,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:12,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-01-18 21:56:12,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,337 INFO L186 Difference]: Start difference. First operand has 161 places, 164 transitions, 337 flow. Second operand 3 states and 491 transitions. [2022-01-18 21:56:12,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 385 flow [2022-01-18 21:56:12,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 21:56:12,344 INFO L242 Difference]: Finished difference. Result has 157 places, 156 transitions, 331 flow [2022-01-18 21:56:12,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2022-01-18 21:56:12,349 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, -4 predicate places. [2022-01-18 21:56:12,349 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 331 flow [2022-01-18 21:56:12,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,351 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:12,351 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:12,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 21:56:12,351 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-01-18 21:56:12,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:12,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071792351] [2022-01-18 21:56:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:12,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:12,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:12,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071792351] [2022-01-18 21:56:12,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071792351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:12,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:12,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 21:56:12,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075921429] [2022-01-18 21:56:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:12,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 21:56:12,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 21:56:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 21:56:12,478 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 176 [2022-01-18 21:56:12,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:12,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 176 [2022-01-18 21:56:12,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:12,582 INFO L129 PetriNetUnfolder]: 34/594 cut-off events. [2022-01-18 21:56:12,582 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-18 21:56:12,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 594 events. 34/594 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2041 event pairs, 11 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 411. Up to 45 conditions per place. [2022-01-18 21:56:12,586 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 16 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-01-18 21:56:12,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 392 flow [2022-01-18 21:56:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 21:56:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-18 21:56:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-01-18 21:56:12,588 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9161931818181818 [2022-01-18 21:56:12,588 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-01-18 21:56:12,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-01-18 21:56:12,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:12,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-01-18 21:56:12,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,591 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,591 INFO L186 Difference]: Start difference. First operand has 157 places, 156 transitions, 331 flow. Second operand 4 states and 645 transitions. [2022-01-18 21:56:12,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 392 flow [2022-01-18 21:56:12,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 164 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 21:56:12,596 INFO L242 Difference]: Finished difference. Result has 161 places, 159 transitions, 356 flow [2022-01-18 21:56:12,597 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2022-01-18 21:56:12,597 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2022-01-18 21:56:12,597 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 356 flow [2022-01-18 21:56:12,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,598 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:12,598 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:12,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 21:56:12,598 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1664854431, now seen corresponding path program 1 times [2022-01-18 21:56:12,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518851681] [2022-01-18 21:56:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:12,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:12,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:12,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518851681] [2022-01-18 21:56:12,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518851681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:12,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:12,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 21:56:12,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121245562] [2022-01-18 21:56:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:12,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 21:56:12,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 21:56:12,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 21:56:12,689 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-18 21:56:12,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:12,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-18 21:56:12,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:12,839 INFO L129 PetriNetUnfolder]: 127/1271 cut-off events. [2022-01-18 21:56:12,839 INFO L130 PetriNetUnfolder]: For 90/100 co-relation queries the response was YES. [2022-01-18 21:56:12,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1271 events. 127/1271 cut-off events. For 90/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6983 event pairs, 33 based on Foata normal form. 12/1209 useless extension candidates. Maximal degree in co-relation 1334. Up to 135 conditions per place. [2022-01-18 21:56:12,846 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 25 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2022-01-18 21:56:12,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 447 flow [2022-01-18 21:56:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 21:56:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 21:56:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-01-18 21:56:12,847 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9204545454545454 [2022-01-18 21:56:12,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2022-01-18 21:56:12,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2022-01-18 21:56:12,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:12,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2022-01-18 21:56:12,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,850 INFO L186 Difference]: Start difference. First operand has 161 places, 159 transitions, 356 flow. Second operand 3 states and 486 transitions. [2022-01-18 21:56:12,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 447 flow [2022-01-18 21:56:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 171 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 21:56:12,855 INFO L242 Difference]: Finished difference. Result has 164 places, 163 transitions, 396 flow [2022-01-18 21:56:12,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=164, PETRI_TRANSITIONS=163} [2022-01-18 21:56:12,857 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2022-01-18 21:56:12,857 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 396 flow [2022-01-18 21:56:12,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:12,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:12,857 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:12,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 21:56:12,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-01-18 21:56:12,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:12,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168520249] [2022-01-18 21:56:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:12,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:12,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168520249] [2022-01-18 21:56:12,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168520249] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 21:56:12,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705403577] [2022-01-18 21:56:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:12,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:56:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:56:12,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 21:56:12,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 21:56:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:13,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 21:56:13,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 21:56:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:13,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 21:56:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:13,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705403577] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 21:56:13,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 21:56:13,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 21:56:13,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566491315] [2022-01-18 21:56:13,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 21:56:13,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 21:56:13,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 21:56:13,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 21:56:13,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-18 21:56:13,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 163 transitions, 396 flow. Second operand has 10 states, 10 states have (on average 152.5) internal successors, (1525), 10 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:13,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:13,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-18 21:56:13,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:13,863 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([472] L1009-->L1011: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][182], [34#L946-2true, Black: 190#true, Black: 178#(= ~top~0 0), 32#L1023-4true, 192#(<= 1 ~top~0), 117#L1011true, Black: 183#(= |t1Thread1of1ForFork0_push_#res#1| 0), 196#true, Black: 186#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), t2Thread1of1ForFork1InUse]) [2022-01-18 21:56:13,864 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1009-->L1009-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][183], [34#L946-2true, Black: 192#(<= 1 ~top~0), Black: 178#(= ~top~0 0), 32#L1023-4true, 190#true, 86#L1009-1true, 234#(<= ~top~0 0), Black: 183#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 186#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), t2Thread1of1ForFork1InUse]) [2022-01-18 21:56:13,864 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-18 21:56:13,864 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-18 21:56:13,908 INFO L129 PetriNetUnfolder]: 387/3002 cut-off events. [2022-01-18 21:56:13,908 INFO L130 PetriNetUnfolder]: For 1007/1065 co-relation queries the response was YES. [2022-01-18 21:56:13,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 3002 events. 387/3002 cut-off events. For 1007/1065 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 21704 event pairs, 43 based on Foata normal form. 40/2882 useless extension candidates. Maximal degree in co-relation 3942. Up to 300 conditions per place. [2022-01-18 21:56:13,923 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 86 selfloop transitions, 46 changer transitions 1/273 dead transitions. [2022-01-18 21:56:13,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 1078 flow [2022-01-18 21:56:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-18 21:56:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-18 21:56:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2831 transitions. [2022-01-18 21:56:13,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8936237373737373 [2022-01-18 21:56:13,927 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2831 transitions. [2022-01-18 21:56:13,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2831 transitions. [2022-01-18 21:56:13,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:13,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2831 transitions. [2022-01-18 21:56:13,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 157.27777777777777) internal successors, (2831), 18 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:13,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:13,937 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:13,937 INFO L186 Difference]: Start difference. First operand has 164 places, 163 transitions, 396 flow. Second operand 18 states and 2831 transitions. [2022-01-18 21:56:13,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 1078 flow [2022-01-18 21:56:13,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 273 transitions, 1016 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-18 21:56:13,944 INFO L242 Difference]: Finished difference. Result has 185 places, 218 transitions, 767 flow [2022-01-18 21:56:13,945 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=767, PETRI_PLACES=185, PETRI_TRANSITIONS=218} [2022-01-18 21:56:13,945 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 24 predicate places. [2022-01-18 21:56:13,946 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 218 transitions, 767 flow [2022-01-18 21:56:13,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 152.5) internal successors, (1525), 10 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:13,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:13,946 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:13,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 21:56:14,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:56:14,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 754166100, now seen corresponding path program 1 times [2022-01-18 21:56:14,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:14,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32009925] [2022-01-18 21:56:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:14,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:14,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32009925] [2022-01-18 21:56:14,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32009925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:14,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:14,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 21:56:14,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937549959] [2022-01-18 21:56:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:14,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 21:56:14,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:14,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 21:56:14,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 21:56:14,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2022-01-18 21:56:14,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 218 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:14,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2022-01-18 21:56:14,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:14,288 INFO L129 PetriNetUnfolder]: 54/1111 cut-off events. [2022-01-18 21:56:14,288 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-01-18 21:56:14,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 1111 events. 54/1111 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4861 event pairs, 9 based on Foata normal form. 18/1086 useless extension candidates. Maximal degree in co-relation 1132. Up to 51 conditions per place. [2022-01-18 21:56:14,292 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 12 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2022-01-18 21:56:14,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 544 flow [2022-01-18 21:56:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 21:56:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 21:56:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-01-18 21:56:14,294 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2022-01-18 21:56:14,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2022-01-18 21:56:14,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2022-01-18 21:56:14,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:14,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2022-01-18 21:56:14,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,296 INFO L186 Difference]: Start difference. First operand has 185 places, 218 transitions, 767 flow. Second operand 3 states and 480 transitions. [2022-01-18 21:56:14,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 544 flow [2022-01-18 21:56:14,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 177 transitions, 522 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-18 21:56:14,299 INFO L242 Difference]: Finished difference. Result has 175 places, 175 transitions, 491 flow [2022-01-18 21:56:14,300 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=175, PETRI_TRANSITIONS=175} [2022-01-18 21:56:14,300 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 14 predicate places. [2022-01-18 21:56:14,300 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 491 flow [2022-01-18 21:56:14,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,301 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:14,301 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:14,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 21:56:14,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 33999950, now seen corresponding path program 1 times [2022-01-18 21:56:14,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:14,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550920303] [2022-01-18 21:56:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:14,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:14,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:14,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550920303] [2022-01-18 21:56:14,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550920303] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:14,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:14,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-18 21:56:14,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520219919] [2022-01-18 21:56:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:14,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 21:56:14,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 21:56:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-01-18 21:56:14,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-18 21:56:14,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 491 flow. Second operand has 24 states, 24 states have (on average 99.54166666666667) internal successors, (2389), 24 states have internal predecessors, (2389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:14,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:14,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-18 21:56:14,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:17,612 INFO L129 PetriNetUnfolder]: 1122/4498 cut-off events. [2022-01-18 21:56:17,612 INFO L130 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2022-01-18 21:56:17,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 4498 events. 1122/4498 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 31985 event pairs, 173 based on Foata normal form. 20/4368 useless extension candidates. Maximal degree in co-relation 5128. Up to 1458 conditions per place. [2022-01-18 21:56:17,639 INFO L132 encePairwiseOnDemand]: 139/176 looper letters, 249 selfloop transitions, 59 changer transitions 33/427 dead transitions. [2022-01-18 21:56:17,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 427 transitions, 1859 flow [2022-01-18 21:56:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-18 21:56:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-18 21:56:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4579 transitions. [2022-01-18 21:56:17,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5912964876033058 [2022-01-18 21:56:17,647 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4579 transitions. [2022-01-18 21:56:17,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4579 transitions. [2022-01-18 21:56:17,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:17,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4579 transitions. [2022-01-18 21:56:17,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 104.06818181818181) internal successors, (4579), 44 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:17,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:17,664 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:17,665 INFO L186 Difference]: Start difference. First operand has 175 places, 175 transitions, 491 flow. Second operand 44 states and 4579 transitions. [2022-01-18 21:56:17,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 427 transitions, 1859 flow [2022-01-18 21:56:17,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 427 transitions, 1855 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 21:56:17,672 INFO L242 Difference]: Finished difference. Result has 256 places, 230 transitions, 974 flow [2022-01-18 21:56:17,673 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=974, PETRI_PLACES=256, PETRI_TRANSITIONS=230} [2022-01-18 21:56:17,673 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 95 predicate places. [2022-01-18 21:56:17,673 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 230 transitions, 974 flow [2022-01-18 21:56:17,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 99.54166666666667) internal successors, (2389), 24 states have internal predecessors, (2389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:17,674 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:17,674 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:17,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 21:56:17,674 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1463024058, now seen corresponding path program 2 times [2022-01-18 21:56:17,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310868993] [2022-01-18 21:56:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:17,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:18,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:18,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310868993] [2022-01-18 21:56:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310868993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:18,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 21:56:18,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783219301] [2022-01-18 21:56:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:18,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 21:56:18,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 21:56:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-01-18 21:56:18,304 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-18 21:56:18,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 230 transitions, 974 flow. Second operand has 28 states, 28 states have (on average 85.53571428571429) internal successors, (2395), 28 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:18,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:18,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-18 21:56:18,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:21,166 INFO L129 PetriNetUnfolder]: 1758/7143 cut-off events. [2022-01-18 21:56:21,227 INFO L130 PetriNetUnfolder]: For 5419/5421 co-relation queries the response was YES. [2022-01-18 21:56:21,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16676 conditions, 7143 events. 1758/7143 cut-off events. For 5419/5421 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 54981 event pairs, 452 based on Foata normal form. 14/7021 useless extension candidates. Maximal degree in co-relation 11059. Up to 2353 conditions per place. [2022-01-18 21:56:21,271 INFO L132 encePairwiseOnDemand]: 138/176 looper letters, 288 selfloop transitions, 60 changer transitions 26/450 dead transitions. [2022-01-18 21:56:21,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 450 transitions, 2751 flow [2022-01-18 21:56:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 21:56:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-18 21:56:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3009 transitions. [2022-01-18 21:56:21,277 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5180785123966942 [2022-01-18 21:56:21,277 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3009 transitions. [2022-01-18 21:56:21,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3009 transitions. [2022-01-18 21:56:21,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:21,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3009 transitions. [2022-01-18 21:56:21,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 91.18181818181819) internal successors, (3009), 33 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:21,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 176.0) internal successors, (5984), 34 states have internal predecessors, (5984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:21,289 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 176.0) internal successors, (5984), 34 states have internal predecessors, (5984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:21,289 INFO L186 Difference]: Start difference. First operand has 256 places, 230 transitions, 974 flow. Second operand 33 states and 3009 transitions. [2022-01-18 21:56:21,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 450 transitions, 2751 flow [2022-01-18 21:56:21,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 450 transitions, 2739 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-18 21:56:21,308 INFO L242 Difference]: Finished difference. Result has 302 places, 265 transitions, 1447 flow [2022-01-18 21:56:21,309 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1447, PETRI_PLACES=302, PETRI_TRANSITIONS=265} [2022-01-18 21:56:21,309 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 141 predicate places. [2022-01-18 21:56:21,309 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 265 transitions, 1447 flow [2022-01-18 21:56:21,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 85.53571428571429) internal successors, (2395), 28 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:21,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:21,310 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:21,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 21:56:21,310 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1698324662, now seen corresponding path program 3 times [2022-01-18 21:56:21,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475622243] [2022-01-18 21:56:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:21,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:22,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:22,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475622243] [2022-01-18 21:56:22,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475622243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:22,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:22,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-18 21:56:22,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284962486] [2022-01-18 21:56:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:22,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-18 21:56:22,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-18 21:56:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-01-18 21:56:22,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-18 21:56:22,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 265 transitions, 1447 flow. Second operand has 28 states, 28 states have (on average 85.53571428571429) internal successors, (2395), 28 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:22,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:22,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-18 21:56:22,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:26,075 INFO L129 PetriNetUnfolder]: 2158/8843 cut-off events. [2022-01-18 21:56:26,076 INFO L130 PetriNetUnfolder]: For 9626/9629 co-relation queries the response was YES. [2022-01-18 21:56:26,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21708 conditions, 8843 events. 2158/8843 cut-off events. For 9626/9629 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 73367 event pairs, 285 based on Foata normal form. 33/8716 useless extension candidates. Maximal degree in co-relation 13595. Up to 1596 conditions per place. [2022-01-18 21:56:26,220 INFO L132 encePairwiseOnDemand]: 140/176 looper letters, 263 selfloop transitions, 126 changer transitions 33/498 dead transitions. [2022-01-18 21:56:26,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 498 transitions, 3350 flow [2022-01-18 21:56:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 21:56:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-18 21:56:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4052 transitions. [2022-01-18 21:56:26,225 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5116161616161616 [2022-01-18 21:56:26,225 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4052 transitions. [2022-01-18 21:56:26,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4052 transitions. [2022-01-18 21:56:26,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:26,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4052 transitions. [2022-01-18 21:56:26,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 90.04444444444445) internal successors, (4052), 45 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:26,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 176.0) internal successors, (8096), 46 states have internal predecessors, (8096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:26,243 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 176.0) internal successors, (8096), 46 states have internal predecessors, (8096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:26,243 INFO L186 Difference]: Start difference. First operand has 302 places, 265 transitions, 1447 flow. Second operand 45 states and 4052 transitions. [2022-01-18 21:56:26,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 498 transitions, 3350 flow [2022-01-18 21:56:26,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 498 transitions, 3298 flow, removed 7 selfloop flow, removed 14 redundant places. [2022-01-18 21:56:26,276 INFO L242 Difference]: Finished difference. Result has 359 places, 301 transitions, 2187 flow [2022-01-18 21:56:26,277 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2187, PETRI_PLACES=359, PETRI_TRANSITIONS=301} [2022-01-18 21:56:26,278 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 198 predicate places. [2022-01-18 21:56:26,278 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 301 transitions, 2187 flow [2022-01-18 21:56:26,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 85.53571428571429) internal successors, (2395), 28 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:26,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:26,284 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:26,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 21:56:26,284 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1159186773, now seen corresponding path program 1 times [2022-01-18 21:56:26,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:26,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169738251] [2022-01-18 21:56:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:26,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:26,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:26,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169738251] [2022-01-18 21:56:26,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169738251] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 21:56:26,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687603660] [2022-01-18 21:56:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:26,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:56:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:56:26,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 21:56:26,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 21:56:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:26,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 21:56:26,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 21:56:28,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-18 21:56:29,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-01-18 21:56:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:29,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 21:56:29,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-01-18 21:56:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-18 21:56:30,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687603660] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 21:56:30,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 21:56:30,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-01-18 21:56:30,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395238214] [2022-01-18 21:56:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:30,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-18 21:56:30,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-18 21:56:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4313, Unknown=0, NotChecked=0, Total=4556 [2022-01-18 21:56:30,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-18 21:56:30,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 301 transitions, 2187 flow. Second operand has 22 states, 22 states have (on average 100.63636363636364) internal successors, (2214), 22 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:30,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:30,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-18 21:56:30,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:37,210 INFO L129 PetriNetUnfolder]: 3191/13252 cut-off events. [2022-01-18 21:56:37,210 INFO L130 PetriNetUnfolder]: For 24497/24497 co-relation queries the response was YES. [2022-01-18 21:56:37,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35911 conditions, 13252 events. 3191/13252 cut-off events. For 24497/24497 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 121819 event pairs, 427 based on Foata normal form. 8/12999 useless extension candidates. Maximal degree in co-relation 18682. Up to 1810 conditions per place. [2022-01-18 21:56:37,359 INFO L132 encePairwiseOnDemand]: 143/176 looper letters, 286 selfloop transitions, 255 changer transitions 3/630 dead transitions. [2022-01-18 21:56:37,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 630 transitions, 5256 flow [2022-01-18 21:56:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 21:56:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-18 21:56:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 6634 transitions. [2022-01-18 21:56:37,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5798951048951049 [2022-01-18 21:56:37,367 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 6634 transitions. [2022-01-18 21:56:37,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 6634 transitions. [2022-01-18 21:56:37,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:37,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 6634 transitions. [2022-01-18 21:56:37,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 102.06153846153846) internal successors, (6634), 65 states have internal predecessors, (6634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:37,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 176.0) internal successors, (11616), 66 states have internal predecessors, (11616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:37,387 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 176.0) internal successors, (11616), 66 states have internal predecessors, (11616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:37,387 INFO L186 Difference]: Start difference. First operand has 359 places, 301 transitions, 2187 flow. Second operand 65 states and 6634 transitions. [2022-01-18 21:56:37,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 630 transitions, 5256 flow [2022-01-18 21:56:37,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 630 transitions, 4904 flow, removed 154 selfloop flow, removed 14 redundant places. [2022-01-18 21:56:37,476 INFO L242 Difference]: Finished difference. Result has 426 places, 451 transitions, 3988 flow [2022-01-18 21:56:37,476 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=3988, PETRI_PLACES=426, PETRI_TRANSITIONS=451} [2022-01-18 21:56:37,477 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 265 predicate places. [2022-01-18 21:56:37,477 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 451 transitions, 3988 flow [2022-01-18 21:56:37,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 100.63636363636364) internal successors, (2214), 22 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:37,478 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:37,478 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:37,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 21:56:37,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-18 21:56:37,696 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:56:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2029778237, now seen corresponding path program 2 times [2022-01-18 21:56:37,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:37,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956878369] [2022-01-18 21:56:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:37,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:38,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956878369] [2022-01-18 21:56:38,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956878369] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 21:56:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584505261] [2022-01-18 21:56:38,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 21:56:38,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:56:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:56:38,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 21:56:38,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 21:56:38,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 21:56:38,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 21:56:38,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 21:56:38,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 21:56:38,855 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 21:56:38,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-18 21:56:38,882 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 21:56:38,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 21:56:39,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-18 21:56:39,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-01-18 21:56:40,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-01-18 21:56:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-18 21:56:40,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 21:56:41,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_244) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-01-18 21:56:41,218 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 21:56:41,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-18 21:56:41,225 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 21:56:41,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 52 [2022-01-18 21:56:41,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-01-18 21:56:42,063 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 21:56:42,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-18 21:56:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-18 21:56:42,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584505261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 21:56:42,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 21:56:42,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-01-18 21:56:42,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130661389] [2022-01-18 21:56:42,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 21:56:42,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-18 21:56:42,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-18 21:56:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-01-18 21:56:42,077 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-18 21:56:42,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 451 transitions, 3988 flow. Second operand has 76 states, 76 states have (on average 86.32894736842105) internal successors, (6561), 76 states have internal predecessors, (6561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:56:42,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:42,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-18 21:56:42,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:58:11,296 INFO L129 PetriNetUnfolder]: 8917/37452 cut-off events. [2022-01-18 21:58:11,296 INFO L130 PetriNetUnfolder]: For 81368/81376 co-relation queries the response was YES. [2022-01-18 21:58:11,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107112 conditions, 37452 events. 8917/37452 cut-off events. For 81368/81376 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 419874 event pairs, 986 based on Foata normal form. 45/36794 useless extension candidates. Maximal degree in co-relation 81546. Up to 4745 conditions per place. [2022-01-18 21:58:11,781 INFO L132 encePairwiseOnDemand]: 131/176 looper letters, 1719 selfloop transitions, 1381 changer transitions 82/3258 dead transitions. [2022-01-18 21:58:11,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 3258 transitions, 29145 flow [2022-01-18 21:58:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2022-01-18 21:58:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2022-01-18 21:58:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 41974 transitions. [2022-01-18 21:58:11,812 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49685132575757573 [2022-01-18 21:58:11,812 INFO L72 ComplementDD]: Start complementDD. Operand 480 states and 41974 transitions. [2022-01-18 21:58:11,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 41974 transitions. [2022-01-18 21:58:11,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:58:11,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 480 states and 41974 transitions. [2022-01-18 21:58:11,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 481 states, 480 states have (on average 87.44583333333334) internal successors, (41974), 480 states have internal predecessors, (41974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:12,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 481 states, 481 states have (on average 176.0) internal successors, (84656), 481 states have internal predecessors, (84656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:12,132 INFO L81 ComplementDD]: Finished complementDD. Result has 481 states, 481 states have (on average 176.0) internal successors, (84656), 481 states have internal predecessors, (84656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:12,133 INFO L186 Difference]: Start difference. First operand has 426 places, 451 transitions, 3988 flow. Second operand 480 states and 41974 transitions. [2022-01-18 21:58:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 3258 transitions, 29145 flow [2022-01-18 21:58:12,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 3258 transitions, 26379 flow, removed 1323 selfloop flow, removed 9 redundant places. [2022-01-18 21:58:12,586 INFO L242 Difference]: Finished difference. Result has 991 places, 1779 transitions, 18335 flow [2022-01-18 21:58:12,587 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=3532, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=480, PETRI_FLOW=18335, PETRI_PLACES=991, PETRI_TRANSITIONS=1779} [2022-01-18 21:58:12,587 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 830 predicate places. [2022-01-18 21:58:12,587 INFO L470 AbstractCegarLoop]: Abstraction has has 991 places, 1779 transitions, 18335 flow [2022-01-18 21:58:12,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 86.32894736842105) internal successors, (6561), 76 states have internal predecessors, (6561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:12,588 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:58:12,589 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:58:12,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 21:58:12,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:58:12,800 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:58:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:58:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-01-18 21:58:12,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:58:12,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022379005] [2022-01-18 21:58:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:58:12,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:58:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:58:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:12,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:58:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022379005] [2022-01-18 21:58:12,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022379005] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 21:58:12,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392692508] [2022-01-18 21:58:12,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 21:58:12,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:58:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:58:12,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 21:58:12,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 21:58:12,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 21:58:12,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 21:58:12,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 21:58:12,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 21:58:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:13,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 21:58:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:13,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392692508] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 21:58:13,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 21:58:13,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-01-18 21:58:13,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435263943] [2022-01-18 21:58:13,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 21:58:13,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 21:58:13,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:58:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 21:58:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-18 21:58:13,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-18 21:58:13,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 1779 transitions, 18335 flow. Second operand has 13 states, 13 states have (on average 152.84615384615384) internal successors, (1987), 13 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:13,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:58:13,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-18 21:58:13,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:58:24,393 INFO L129 PetriNetUnfolder]: 2163/25733 cut-off events. [2022-01-18 21:58:24,393 INFO L130 PetriNetUnfolder]: For 109446/109940 co-relation queries the response was YES. [2022-01-18 21:58:24,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79322 conditions, 25733 events. 2163/25733 cut-off events. For 109446/109940 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 285144 event pairs, 582 based on Foata normal form. 76/25110 useless extension candidates. Maximal degree in co-relation 78462. Up to 1887 conditions per place. [2022-01-18 21:58:24,932 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 453 selfloop transitions, 315 changer transitions 1/2007 dead transitions. [2022-01-18 21:58:24,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 2007 transitions, 22275 flow [2022-01-18 21:58:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-18 21:58:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-18 21:58:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2795 transitions. [2022-01-18 21:58:24,935 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.882260101010101 [2022-01-18 21:58:24,935 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2795 transitions. [2022-01-18 21:58:24,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2795 transitions. [2022-01-18 21:58:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:58:24,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2795 transitions. [2022-01-18 21:58:24,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 155.27777777777777) internal successors, (2795), 18 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:24,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:24,940 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 176.0) internal successors, (3344), 19 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:24,940 INFO L186 Difference]: Start difference. First operand has 991 places, 1779 transitions, 18335 flow. Second operand 18 states and 2795 transitions. [2022-01-18 21:58:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 2007 transitions, 22275 flow [2022-01-18 21:58:25,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 2007 transitions, 20004 flow, removed 790 selfloop flow, removed 20 redundant places. [2022-01-18 21:58:25,808 INFO L242 Difference]: Finished difference. Result has 968 places, 1841 transitions, 17628 flow [2022-01-18 21:58:25,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=16080, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=17628, PETRI_PLACES=968, PETRI_TRANSITIONS=1841} [2022-01-18 21:58:25,810 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 807 predicate places. [2022-01-18 21:58:25,810 INFO L470 AbstractCegarLoop]: Abstraction has has 968 places, 1841 transitions, 17628 flow [2022-01-18 21:58:25,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 152.84615384615384) internal successors, (1987), 13 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:25,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:58:25,810 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:58:25,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-18 21:58:26,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:58:26,023 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 21:58:26,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:58:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -958159694, now seen corresponding path program 1 times [2022-01-18 21:58:26,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:58:26,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896793802] [2022-01-18 21:58:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:58:26,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:58:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:58:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:26,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:58:26,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896793802] [2022-01-18 21:58:26,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896793802] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 21:58:26,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738896414] [2022-01-18 21:58:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:58:26,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 21:58:26,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:58:26,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 21:58:26,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 21:58:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:58:26,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-18 21:58:26,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 21:58:27,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-18 21:58:28,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 21:58:28,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-01-18 21:58:30,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-01-18 21:58:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:30,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 21:58:55,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 21:58:55,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-01-18 21:58:55,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 21:58:55,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 40 [2022-01-18 21:58:55,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-01-18 21:58:55,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 21:58:55,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-01-18 21:58:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:58:56,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738896414] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 21:58:56,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 21:58:56,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-01-18 21:58:56,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455829438] [2022-01-18 21:58:56,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 21:58:56,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-18 21:58:56,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:58:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-18 21:58:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=7655, Unknown=22, NotChecked=0, Total=8372 [2022-01-18 21:58:56,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-18 21:58:56,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 1841 transitions, 17628 flow. Second operand has 92 states, 92 states have (on average 100.28260869565217) internal successors, (9226), 92 states have internal predecessors, (9226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:58:56,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:58:56,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-18 21:58:56,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:59:15,538 WARN L228 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 21:59:51,628 WARN L228 SmtUtils]: Spent 11.34s on a formula simplification. DAG size of input: 101 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:00:54,779 WARN L228 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:01:20,898 WARN L228 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:02:15,408 WARN L228 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:02:36,104 WARN L228 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:04:52,769 WARN L228 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:05:15,323 WARN L228 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 22:05:46,633 INFO L129 PetriNetUnfolder]: 19582/86104 cut-off events. [2022-01-18 22:05:46,633 INFO L130 PetriNetUnfolder]: For 1055824/1055829 co-relation queries the response was YES. [2022-01-18 22:05:50,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385347 conditions, 86104 events. 19582/86104 cut-off events. For 1055824/1055829 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 1055537 event pairs, 4498 based on Foata normal form. 281/84867 useless extension candidates. Maximal degree in co-relation 383206. Up to 19102 conditions per place. [2022-01-18 22:05:50,504 INFO L132 encePairwiseOnDemand]: 132/176 looper letters, 4198 selfloop transitions, 1800 changer transitions 88/6172 dead transitions. [2022-01-18 22:05:50,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1151 places, 6172 transitions, 68792 flow [2022-01-18 22:05:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-01-18 22:05:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-01-18 22:05:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 18886 transitions. [2022-01-18 22:05:50,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5831892292490118 [2022-01-18 22:05:50,514 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 18886 transitions. [2022-01-18 22:05:50,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 18886 transitions. [2022-01-18 22:05:50,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:05:50,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 18886 transitions. [2022-01-18 22:05:50,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 185 states, 184 states have (on average 102.6413043478261) internal successors, (18886), 184 states have internal predecessors, (18886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:05:50,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 185 states, 185 states have (on average 176.0) internal successors, (32560), 185 states have internal predecessors, (32560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:05:50,552 INFO L81 ComplementDD]: Finished complementDD. Result has 185 states, 185 states have (on average 176.0) internal successors, (32560), 185 states have internal predecessors, (32560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:05:50,553 INFO L186 Difference]: Start difference. First operand has 968 places, 1841 transitions, 17628 flow. Second operand 184 states and 18886 transitions. [2022-01-18 22:05:50,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1151 places, 6172 transitions, 68792 flow [2022-01-18 22:05:54,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1141 places, 6172 transitions, 67165 flow, removed 310 selfloop flow, removed 10 redundant places. [2022-01-18 22:05:54,823 INFO L242 Difference]: Finished difference. Result has 1253 places, 3433 transitions, 40455 flow [2022-01-18 22:05:54,825 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=16978, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=184, PETRI_FLOW=40455, PETRI_PLACES=1253, PETRI_TRANSITIONS=3433} [2022-01-18 22:05:54,825 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 1092 predicate places. [2022-01-18 22:05:54,825 INFO L470 AbstractCegarLoop]: Abstraction has has 1253 places, 3433 transitions, 40455 flow [2022-01-18 22:05:54,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 100.28260869565217) internal successors, (9226), 92 states have internal predecessors, (9226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:05:54,826 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:05:54,827 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:05:54,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 22:05:55,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 22:05:55,028 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-18 22:05:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:05:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash 127973202, now seen corresponding path program 2 times [2022-01-18 22:05:55,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:05:55,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776388840] [2022-01-18 22:05:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:05:55,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:05:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:05:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:05:55,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:05:55,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776388840] [2022-01-18 22:05:55,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776388840] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 22:05:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248742461] [2022-01-18 22:05:55,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 22:05:55,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 22:05:55,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:05:55,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 22:05:55,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 22:05:55,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 22:05:55,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 22:05:55,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-18 22:05:55,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 22:05:56,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-18 22:05:57,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 22:05:57,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-01-18 22:05:58,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-01-18 22:05:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:05:58,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 22:06:01,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) is different from false [2022-01-18 22:06:18,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) is different from false [2022-01-18 22:06:30,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-01-18 22:06:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-18 22:06:31,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248742461] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 22:06:31,389 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 22:06:31,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 29] total 86 [2022-01-18 22:06:31,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725850466] [2022-01-18 22:06:31,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 22:06:31,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-18 22:06:31,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:06:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-18 22:06:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=6665, Unknown=18, NotChecked=330, Total=7310 [2022-01-18 22:06:31,394 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-18 22:06:31,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1253 places, 3433 transitions, 40455 flow. Second operand has 86 states, 86 states have (on average 100.51162790697674) internal successors, (8644), 86 states have internal predecessors, (8644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:06:31,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:06:31,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-18 22:06:31,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:06:37,018 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse4 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) .cse3 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:06:38,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:06:41,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-01-18 22:06:45,407 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse0 4294967296) (<= 0 .cse1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-01-18 22:06:55,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse3 (select .cse5 0)) (.cse4 (not .cse2)) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6))) (.cse1 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:06:59,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-01-18 22:07:01,002 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:07:06,412 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-01-18 22:07:11,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< .cse0 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-01-18 22:07:29,255 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse10 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse10 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| .cse1))) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (select .cse10 (+ .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse8 (not .cse3)) (.cse0 (select .cse9 (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= 0 .cse4) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= 0 .cse5) (<= .cse6 4) (<= 0 .cse7) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (< .cse4 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse8) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< (div .cse7 (- 4294967296)) (+ (div (+ (* (- 1) .cse7) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse5 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse6) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (< .cse7 4294967296) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse8)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:07:30,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse9 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse9 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse6 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) 0)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse8 (select .cse9 (+ (- 4) .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 0 |c_t2Thread1of1ForFork1_get_top_#res#1|) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= 0 .cse4) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= .cse5 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (< .cse4 4294967296) (<= 0 .cse6) (<= .cse6 4) (<= |c_t2Thread1of1ForFork1_get_top_#res#1| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse7) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 0 .cse8) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse5) (< (div .cse8 (- 4294967296)) (+ (div (+ (* (- 1) .cse8) 4) 4294967296) 1)) (= 0 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse7)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (< .cse8 4294967296)))) is different from false [2022-01-18 22:07:30,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse4 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:07:32,964 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-01-18 22:07:36,727 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ (* 4294967295 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967294) 4294967296) 0)) (forall ((~top~0 Int)) (let ((.cse0 (* ~top~0 4))) (= (+ .cse0 |c_~#arr~0.offset|) (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false Received shutdown request... [2022-01-18 22:09:49,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 22:09:49,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 22:09:50,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 22:09:51,179 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-18 22:09:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2022-01-18 22:09:51,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-01-18 22:09:51,196 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:09:51,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 22:09:51,196 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-18 22:09:51,197 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-01-18 22:09:51,198 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:09:51,198 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-18 22:09:51,198 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-18 22:09:51,198 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:09:51,200 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-01-18 22:09:51,202 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:09:51,202 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:09:51,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:09:51 BasicIcfg [2022-01-18 22:09:51,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:09:51,203 INFO L158 Benchmark]: Toolchain (without parser) took 820420.59ms. Allocated memory was 375.4MB in the beginning and 9.2GB in the end (delta: 8.8GB). Free memory was 317.8MB in the beginning and 4.4GB in the end (delta: -4.1GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.38ms. Allocated memory was 375.4MB in the beginning and 522.2MB in the end (delta: 146.8MB). Free memory was 317.6MB in the beginning and 475.1MB in the end (delta: -157.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 522.2MB. Free memory was 475.1MB in the beginning and 472.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: Boogie Preprocessor took 16.86ms. Allocated memory is still 522.2MB. Free memory was 472.4MB in the beginning and 471.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: RCFGBuilder took 390.32ms. Allocated memory is still 522.2MB. Free memory was 471.0MB in the beginning and 454.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-18 22:09:51,204 INFO L158 Benchmark]: TraceAbstraction took 819503.43ms. Allocated memory was 522.2MB in the beginning and 9.2GB in the end (delta: 8.7GB). Free memory was 454.2MB in the beginning and 4.4GB in the end (delta: -3.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2022-01-18 22:09:51,205 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.11ms. Allocated memory is still 375.4MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 475.38ms. Allocated memory was 375.4MB in the beginning and 522.2MB in the end (delta: 146.8MB). Free memory was 317.6MB in the beginning and 475.1MB in the end (delta: -157.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 522.2MB. Free memory was 475.1MB in the beginning and 472.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 16.86ms. Allocated memory is still 522.2MB. Free memory was 472.4MB in the beginning and 471.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 390.32ms. Allocated memory is still 522.2MB. Free memory was 471.0MB in the beginning and 454.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 819503.43ms. Allocated memory was 522.2MB in the beginning and 9.2GB in the end (delta: 8.7GB). Free memory was 454.2MB in the beginning and 4.4GB in the end (delta: -3.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: 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 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 819.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 739.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14064 SdHoareTripleChecker+Valid, 25.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14064 mSDsluCounter, 17644 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9461 IncrementalHoareTripleChecker+Unchecked, 24241 mSDsCounter, 918 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45253 IncrementalHoareTripleChecker+Invalid, 55632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 918 mSolverCounterUnsat, 714 mSDtfsCounter, 45253 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3554 GetRequests, 1985 SyntacticMatches, 72 SemanticMatches, 1496 ConstructedPredicates, 17 IntricatePredicates, 5 DeprecatedPredicates, 201184 ImplicationChecksByTransitivity, 610.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40455occurred in iteration=12, InterpolantAutomatonStates: 900, 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.4s SatisfiabilityAnalysisTime, 78.1s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2742 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3789 ConstructedInterpolants, 107 QuantifiedInterpolants, 52655 SizeOfPredicates, 157 NumberOfNonLiveVariables, 2141 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 154/1290 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