/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 03:54:54,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:54:54,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:54:54,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:54:54,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:54:54,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:54:54,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:54:54,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:54:54,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:54:54,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:54:54,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:54:54,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:54:54,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:54:54,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:54:54,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:54:54,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:54:54,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:54:54,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:54:54,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:54:54,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:54:54,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:54:54,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:54:54,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:54:54,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:54:54,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:54:54,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:54:54,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:54:54,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:54:54,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:54:54,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:54:54,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:54:54,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:54:54,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:54:54,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:54:54,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:54:54,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:54:54,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:54:54,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:54:54,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:54:54,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:54:54,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:54:54,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 03:54:54,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:54:54,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:54:54,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:54:54,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:54:54,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:54:54,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:54:54,745 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:54:54,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:54:54,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:54:54,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:54:54,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:54:54,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:54:54,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:54:54,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:54:54,748 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 03:54:54,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 03:54:54,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:54:54,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:54:54,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:54:54,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:54:54,955 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:54:54,957 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-19 03:54:55,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe61924b/fb97d35fbc664c1da4fbf4fc69695ee5/FLAGea8a75e1b [2022-01-19 03:54:55,479 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:54:55,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-01-19 03:54:55,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe61924b/fb97d35fbc664c1da4fbf4fc69695ee5/FLAGea8a75e1b [2022-01-19 03:54:55,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe61924b/fb97d35fbc664c1da4fbf4fc69695ee5 [2022-01-19 03:54:55,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:54:55,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:54:55,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:54:55,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:54:55,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:54:55,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:54:55" (1/1) ... [2022-01-19 03:54:55,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae12e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:55, skipping insertion in model container [2022-01-19 03:54:55,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:54:55" (1/1) ... [2022-01-19 03:54:55,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:54:55,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:54:55,884 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-19 03:54:55,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:54:55,924 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:54:55,957 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-19 03:54:55,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:54:56,020 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:54:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56 WrapperNode [2022-01-19 03:54:56,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:54:56,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:54:56,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:54:56,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:54:56,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,078 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-01-19 03:54:56,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:54:56,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:54:56,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:54:56,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:54:56,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:54:56,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:54:56,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:54:56,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:54:56,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (1/1) ... [2022-01-19 03:54:56,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:54:56,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:54:56,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 03:54:56,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 03:54:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 03:54:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 03:54:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 03:54:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 03:54:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:54:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:54:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:54:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:54:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 03:54:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:54:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:54:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:54:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:54:56,176 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 03:54:56,269 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:54:56,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:54:56,544 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:54:56,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:54:56,553 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 03:54:56,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:54:56 BoogieIcfgContainer [2022-01-19 03:54:56,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:54:56,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:54:56,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:54:56,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:54:56,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:54:55" (1/3) ... [2022-01-19 03:54:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1144e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:54:56, skipping insertion in model container [2022-01-19 03:54:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:54:56" (2/3) ... [2022-01-19 03:54:56,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1144e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:54:56, skipping insertion in model container [2022-01-19 03:54:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:54:56" (3/3) ... [2022-01-19 03:54:56,565 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-01-19 03:54:56,574 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:54:56,574 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 03:54:56,574 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:54:56,628 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,628 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,628 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,628 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,629 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,630 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,631 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,631 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,631 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,631 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,632 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,632 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,632 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,632 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,633 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,634 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,634 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,634 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-19 03:54:56,634 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,634 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-19 03:54:56,635 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,635 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,635 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-19 03:54:56,635 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,635 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-19 03:54:56,635 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,636 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,637 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,637 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,637 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,637 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,637 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,638 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,638 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,638 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,638 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,638 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,639 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,639 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,639 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,642 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,643 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,644 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,645 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,645 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,645 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,645 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,645 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,646 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,646 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,646 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,646 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,646 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,647 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,647 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,647 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,648 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,651 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,651 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,651 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,652 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,652 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,652 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,652 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,652 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,653 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,653 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,653 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,653 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,654 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,655 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,655 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,655 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,655 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,655 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,658 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,660 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,660 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,664 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,665 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,668 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,670 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,670 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,670 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,670 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,671 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,673 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,673 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,673 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,673 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,674 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,674 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,674 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,674 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,674 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,675 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,676 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,678 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,679 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,679 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,680 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,680 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,680 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,680 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,680 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,681 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,682 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,682 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,684 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,688 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,689 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,689 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,689 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,690 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,693 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,693 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 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-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,707 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,710 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,710 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,710 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:54:56,719 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:54:56,771 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:54:56,779 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 03:54:56,780 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 03:54:56,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2022-01-19 03:54:56,852 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2022-01-19 03:54:56,852 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:54:56,862 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-19 03:54:56,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 176 transitions, 368 flow [2022-01-19 03:54:56,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 164 transitions, 337 flow [2022-01-19 03:54:56,893 INFO L129 PetriNetUnfolder]: 5/130 cut-off events. [2022-01-19 03:54:56,893 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 03:54:56,893 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:56,894 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-19 03:54:56,894 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-19 03:54:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-01-19 03:54:56,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:56,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577525924] [2022-01-19 03:54:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:56,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:57,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577525924] [2022-01-19 03:54:57,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577525924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:57,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:57,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:54:57,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033266572] [2022-01-19 03:54:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:57,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:54:57,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:57,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:54:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:54:57,220 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-19 03:54:57,223 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-19 03:54:57,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:57,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-19 03:54:57,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:57,422 INFO L129 PetriNetUnfolder]: 88/703 cut-off events. [2022-01-19 03:54:57,422 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 03:54:57,428 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-19 03:54:57,433 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2022-01-19 03:54:57,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 385 flow [2022-01-19 03:54:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:54:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:54:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-01-19 03:54:57,450 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9299242424242424 [2022-01-19 03:54:57,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-01-19 03:54:57,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-01-19 03:54:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-01-19 03:54:57,459 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-19 03:54:57,468 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-19 03:54:57,469 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-19 03:54:57,470 INFO L186 Difference]: Start difference. First operand has 161 places, 164 transitions, 337 flow. Second operand 3 states and 491 transitions. [2022-01-19 03:54:57,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 385 flow [2022-01-19 03:54:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:54:57,480 INFO L242 Difference]: Finished difference. Result has 157 places, 156 transitions, 331 flow [2022-01-19 03:54:57,482 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-19 03:54:57,485 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, -4 predicate places. [2022-01-19 03:54:57,485 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 331 flow [2022-01-19 03:54:57,486 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-19 03:54:57,487 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:57,487 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-19 03:54:57,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 03:54:57,488 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-19 03:54:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-01-19 03:54:57,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:57,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775650604] [2022-01-19 03:54:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:57,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:57,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:57,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775650604] [2022-01-19 03:54:57,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775650604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:57,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:57,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:54:57,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334670946] [2022-01-19 03:54:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:57,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:54:57,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:54:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:54:57,630 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 176 [2022-01-19 03:54:57,631 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-19 03:54:57,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:57,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 176 [2022-01-19 03:54:57,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:57,750 INFO L129 PetriNetUnfolder]: 34/594 cut-off events. [2022-01-19 03:54:57,751 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 03:54:57,754 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-19 03:54:57,756 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 16 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-01-19 03:54:57,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 392 flow [2022-01-19 03:54:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 03:54:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 03:54:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-01-19 03:54:57,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9161931818181818 [2022-01-19 03:54:57,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-01-19 03:54:57,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-01-19 03:54:57,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:57,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-01-19 03:54:57,761 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-19 03:54:57,763 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-19 03:54:57,764 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-19 03:54:57,764 INFO L186 Difference]: Start difference. First operand has 157 places, 156 transitions, 331 flow. Second operand 4 states and 645 transitions. [2022-01-19 03:54:57,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 392 flow [2022-01-19 03:54:57,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 164 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:54:57,772 INFO L242 Difference]: Finished difference. Result has 161 places, 159 transitions, 356 flow [2022-01-19 03:54:57,773 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-19 03:54:57,774 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2022-01-19 03:54:57,812 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 356 flow [2022-01-19 03:54:57,812 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-19 03:54:57,812 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:57,813 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-19 03:54:57,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:54:57,813 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-19 03:54:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1664854431, now seen corresponding path program 1 times [2022-01-19 03:54:57,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:57,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736127621] [2022-01-19 03:54:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:57,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:57,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:57,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736127621] [2022-01-19 03:54:57,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736127621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:57,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:57,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:54:57,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720056600] [2022-01-19 03:54:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:57,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:54:57,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:57,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:54:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:54:57,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-19 03:54:57,926 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-19 03:54:57,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:57,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-19 03:54:57,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:58,139 INFO L129 PetriNetUnfolder]: 127/1271 cut-off events. [2022-01-19 03:54:58,140 INFO L130 PetriNetUnfolder]: For 90/100 co-relation queries the response was YES. [2022-01-19 03:54:58,144 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-19 03:54:58,151 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 25 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2022-01-19 03:54:58,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 447 flow [2022-01-19 03:54:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:54:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:54:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-01-19 03:54:58,153 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9204545454545454 [2022-01-19 03:54:58,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2022-01-19 03:54:58,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2022-01-19 03:54:58,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:58,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2022-01-19 03:54:58,154 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-19 03:54:58,155 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-19 03:54:58,156 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-19 03:54:58,156 INFO L186 Difference]: Start difference. First operand has 161 places, 159 transitions, 356 flow. Second operand 3 states and 486 transitions. [2022-01-19 03:54:58,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 447 flow [2022-01-19 03:54:58,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 171 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:54:58,163 INFO L242 Difference]: Finished difference. Result has 164 places, 163 transitions, 396 flow [2022-01-19 03:54:58,164 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-19 03:54:58,165 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2022-01-19 03:54:58,165 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 396 flow [2022-01-19 03:54:58,166 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-19 03:54:58,166 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:58,166 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-19 03:54:58,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 03:54:58,167 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-19 03:54:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-01-19 03:54:58,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:58,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489433821] [2022-01-19 03:54:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:58,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:58,302 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-19 03:54:58,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:58,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489433821] [2022-01-19 03:54:58,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489433821] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:54:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067755508] [2022-01-19 03:54:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:58,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:54:58,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:54:58,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 03:54:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:58,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:54:58,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:54:58,755 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-19 03:54:58,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:54:58,976 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-19 03:54:58,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067755508] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:54:58,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:54:58,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 03:54:58,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542102018] [2022-01-19 03:54:58,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:54:58,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 03:54:58,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 03:54:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 03:54:58,980 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-19 03:54:58,982 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-19 03:54:58,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:58,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-19 03:54:58,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:59,487 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-19 03:54:59,487 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-19 03:54:59,487 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-19 03:54:59,487 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-19 03:54:59,487 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-19 03:54:59,487 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-19 03:54:59,488 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-19 03:54:59,488 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-19 03:54:59,488 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-19 03:54:59,488 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-19 03:54:59,549 INFO L129 PetriNetUnfolder]: 387/3002 cut-off events. [2022-01-19 03:54:59,549 INFO L130 PetriNetUnfolder]: For 1007/1065 co-relation queries the response was YES. [2022-01-19 03:54:59,559 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-19 03:54:59,568 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 86 selfloop transitions, 46 changer transitions 1/273 dead transitions. [2022-01-19 03:54:59,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 1078 flow [2022-01-19 03:54:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 03:54:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 03:54:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2831 transitions. [2022-01-19 03:54:59,574 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8936237373737373 [2022-01-19 03:54:59,574 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2831 transitions. [2022-01-19 03:54:59,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2831 transitions. [2022-01-19 03:54:59,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:59,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2831 transitions. [2022-01-19 03:54:59,580 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-19 03:54:59,586 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-19 03:54:59,587 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-19 03:54:59,587 INFO L186 Difference]: Start difference. First operand has 164 places, 163 transitions, 396 flow. Second operand 18 states and 2831 transitions. [2022-01-19 03:54:59,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 1078 flow [2022-01-19 03:54:59,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 273 transitions, 1016 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 03:54:59,597 INFO L242 Difference]: Finished difference. Result has 185 places, 218 transitions, 767 flow [2022-01-19 03:54:59,597 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-19 03:54:59,598 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 24 predicate places. [2022-01-19 03:54:59,598 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 218 transitions, 767 flow [2022-01-19 03:54:59,599 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-19 03:54:59,599 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:59,599 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-19 03:54:59,624 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-19 03:54:59,821 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-19 03:54:59,822 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-19 03:54:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 754166100, now seen corresponding path program 1 times [2022-01-19 03:54:59,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:59,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119859400] [2022-01-19 03:54:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:59,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:59,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:59,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119859400] [2022-01-19 03:54:59,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119859400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:59,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:59,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:54:59,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691646107] [2022-01-19 03:54:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:59,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:54:59,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:54:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:54:59,879 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2022-01-19 03:54:59,880 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-19 03:54:59,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:59,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2022-01-19 03:54:59,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:55:00,021 INFO L129 PetriNetUnfolder]: 54/1111 cut-off events. [2022-01-19 03:55:00,021 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-01-19 03:55:00,025 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-19 03:55:00,027 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 12 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2022-01-19 03:55:00,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 544 flow [2022-01-19 03:55:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:55:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:55:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-01-19 03:55:00,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2022-01-19 03:55:00,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2022-01-19 03:55:00,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2022-01-19 03:55:00,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:55:00,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2022-01-19 03:55:00,030 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-19 03:55:00,031 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-19 03:55:00,032 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-19 03:55:00,032 INFO L186 Difference]: Start difference. First operand has 185 places, 218 transitions, 767 flow. Second operand 3 states and 480 transitions. [2022-01-19 03:55:00,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 544 flow [2022-01-19 03:55:00,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 177 transitions, 522 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 03:55:00,037 INFO L242 Difference]: Finished difference. Result has 175 places, 175 transitions, 491 flow [2022-01-19 03:55:00,037 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-19 03:55:00,038 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 14 predicate places. [2022-01-19 03:55:00,038 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 491 flow [2022-01-19 03:55:00,038 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-19 03:55:00,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:00,038 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-19 03:55:00,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 03:55:00,039 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-19 03:55:00,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 33999950, now seen corresponding path program 1 times [2022-01-19 03:55:00,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:00,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551878483] [2022-01-19 03:55:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:00,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:55:00,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:00,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551878483] [2022-01-19 03:55:00,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551878483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:55:00,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:55:00,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-19 03:55:00,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574633199] [2022-01-19 03:55:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:55:00,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 03:55:00,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 03:55:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-01-19 03:55:00,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 03:55:00,778 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-19 03:55:00,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:00,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 03:55:00,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:55:04,225 INFO L129 PetriNetUnfolder]: 1122/4498 cut-off events. [2022-01-19 03:55:04,226 INFO L130 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2022-01-19 03:55:04,238 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-19 03:55:04,253 INFO L132 encePairwiseOnDemand]: 139/176 looper letters, 249 selfloop transitions, 59 changer transitions 33/427 dead transitions. [2022-01-19 03:55:04,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 427 transitions, 1859 flow [2022-01-19 03:55:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 03:55:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 03:55:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4579 transitions. [2022-01-19 03:55:04,266 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5912964876033058 [2022-01-19 03:55:04,266 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4579 transitions. [2022-01-19 03:55:04,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4579 transitions. [2022-01-19 03:55:04,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:55:04,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4579 transitions. [2022-01-19 03:55:04,281 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-19 03:55:04,294 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-19 03:55:04,297 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-19 03:55:04,297 INFO L186 Difference]: Start difference. First operand has 175 places, 175 transitions, 491 flow. Second operand 44 states and 4579 transitions. [2022-01-19 03:55:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 427 transitions, 1859 flow [2022-01-19 03:55:04,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 427 transitions, 1855 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:55:04,307 INFO L242 Difference]: Finished difference. Result has 256 places, 230 transitions, 974 flow [2022-01-19 03:55:04,308 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-19 03:55:04,308 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 95 predicate places. [2022-01-19 03:55:04,308 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 230 transitions, 974 flow [2022-01-19 03:55:04,310 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-19 03:55:04,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:04,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-19 03:55:04,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 03:55:04,310 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-19 03:55:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1463024058, now seen corresponding path program 2 times [2022-01-19 03:55:04,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:04,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956515036] [2022-01-19 03:55:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:04,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:55:05,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:05,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956515036] [2022-01-19 03:55:05,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956515036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:55:05,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:55:05,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 03:55:05,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506212878] [2022-01-19 03:55:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:55:05,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 03:55:05,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 03:55:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-01-19 03:55:05,125 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 03:55:05,127 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-19 03:55:05,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:05,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 03:55:05,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:55:08,741 INFO L129 PetriNetUnfolder]: 1758/7143 cut-off events. [2022-01-19 03:55:08,741 INFO L130 PetriNetUnfolder]: For 5419/5421 co-relation queries the response was YES. [2022-01-19 03:55:08,779 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-19 03:55:08,799 INFO L132 encePairwiseOnDemand]: 138/176 looper letters, 288 selfloop transitions, 60 changer transitions 26/450 dead transitions. [2022-01-19 03:55:08,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 450 transitions, 2751 flow [2022-01-19 03:55:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 03:55:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 03:55:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3009 transitions. [2022-01-19 03:55:08,808 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5180785123966942 [2022-01-19 03:55:08,808 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3009 transitions. [2022-01-19 03:55:08,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3009 transitions. [2022-01-19 03:55:08,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:55:08,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3009 transitions. [2022-01-19 03:55:08,816 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-19 03:55:08,824 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-19 03:55:08,825 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-19 03:55:08,825 INFO L186 Difference]: Start difference. First operand has 256 places, 230 transitions, 974 flow. Second operand 33 states and 3009 transitions. [2022-01-19 03:55:08,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 450 transitions, 2751 flow [2022-01-19 03:55:08,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 450 transitions, 2739 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 03:55:08,856 INFO L242 Difference]: Finished difference. Result has 302 places, 265 transitions, 1447 flow [2022-01-19 03:55:08,856 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-19 03:55:08,857 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 141 predicate places. [2022-01-19 03:55:08,857 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 265 transitions, 1447 flow [2022-01-19 03:55:08,858 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-19 03:55:08,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:08,858 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-19 03:55:08,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 03:55:08,859 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-19 03:55:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1698324662, now seen corresponding path program 3 times [2022-01-19 03:55:08,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:08,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103557156] [2022-01-19 03:55:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:08,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:55:09,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:09,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103557156] [2022-01-19 03:55:09,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103557156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:55:09,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:55:09,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 03:55:09,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800234221] [2022-01-19 03:55:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:55:09,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 03:55:09,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 03:55:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-01-19 03:55:09,894 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 03:55:09,896 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-19 03:55:09,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:09,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 03:55:09,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:55:14,320 INFO L129 PetriNetUnfolder]: 2158/8843 cut-off events. [2022-01-19 03:55:14,320 INFO L130 PetriNetUnfolder]: For 9626/9629 co-relation queries the response was YES. [2022-01-19 03:55:14,431 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-19 03:55:14,452 INFO L132 encePairwiseOnDemand]: 140/176 looper letters, 263 selfloop transitions, 126 changer transitions 33/498 dead transitions. [2022-01-19 03:55:14,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 498 transitions, 3350 flow [2022-01-19 03:55:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-19 03:55:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-19 03:55:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4052 transitions. [2022-01-19 03:55:14,459 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5116161616161616 [2022-01-19 03:55:14,459 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4052 transitions. [2022-01-19 03:55:14,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4052 transitions. [2022-01-19 03:55:14,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:55:14,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4052 transitions. [2022-01-19 03:55:14,480 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-19 03:55:14,490 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-19 03:55:14,492 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-19 03:55:14,492 INFO L186 Difference]: Start difference. First operand has 302 places, 265 transitions, 1447 flow. Second operand 45 states and 4052 transitions. [2022-01-19 03:55:14,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 498 transitions, 3350 flow [2022-01-19 03:55:14,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 498 transitions, 3298 flow, removed 7 selfloop flow, removed 14 redundant places. [2022-01-19 03:55:14,539 INFO L242 Difference]: Finished difference. Result has 359 places, 301 transitions, 2187 flow [2022-01-19 03:55:14,540 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-19 03:55:14,542 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 198 predicate places. [2022-01-19 03:55:14,542 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 301 transitions, 2187 flow [2022-01-19 03:55:14,543 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-19 03:55:14,543 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:14,545 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-19 03:55:14,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 03:55:14,545 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-19 03:55:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1159186773, now seen corresponding path program 1 times [2022-01-19 03:55:14,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:14,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906283113] [2022-01-19 03:55:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:14,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:15,181 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-19 03:55:15,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:15,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906283113] [2022-01-19 03:55:15,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906283113] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:55:15,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439982044] [2022-01-19 03:55:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:15,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:55:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:55:15,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:55:15,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 03:55:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 03:55:15,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:55:16,627 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-19 03:55:17,685 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-19 03:55:17,874 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-19 03:55:17,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:55:18,391 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-19 03:55:19,021 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-19 03:55:19,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439982044] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 03:55:19,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 03:55:19,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-01-19 03:55:19,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675975737] [2022-01-19 03:55:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:55:19,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 03:55:19,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 03:55:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4313, Unknown=0, NotChecked=0, Total=4556 [2022-01-19 03:55:19,026 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 03:55:19,027 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-19 03:55:19,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:19,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 03:55:19,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:55:26,348 INFO L129 PetriNetUnfolder]: 3191/13252 cut-off events. [2022-01-19 03:55:26,348 INFO L130 PetriNetUnfolder]: For 24497/24497 co-relation queries the response was YES. [2022-01-19 03:55:26,461 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-19 03:55:26,504 INFO L132 encePairwiseOnDemand]: 143/176 looper letters, 286 selfloop transitions, 255 changer transitions 3/630 dead transitions. [2022-01-19 03:55:26,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 630 transitions, 5256 flow [2022-01-19 03:55:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-19 03:55:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-19 03:55:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 6634 transitions. [2022-01-19 03:55:26,512 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5798951048951049 [2022-01-19 03:55:26,512 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 6634 transitions. [2022-01-19 03:55:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 6634 transitions. [2022-01-19 03:55:26,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:55:26,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 6634 transitions. [2022-01-19 03:55:26,642 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-19 03:55:26,667 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-19 03:55:26,669 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-19 03:55:26,669 INFO L186 Difference]: Start difference. First operand has 359 places, 301 transitions, 2187 flow. Second operand 65 states and 6634 transitions. [2022-01-19 03:55:26,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 630 transitions, 5256 flow [2022-01-19 03:55:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 630 transitions, 4904 flow, removed 154 selfloop flow, removed 14 redundant places. [2022-01-19 03:55:26,783 INFO L242 Difference]: Finished difference. Result has 426 places, 451 transitions, 3988 flow [2022-01-19 03:55:26,783 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-19 03:55:26,784 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 265 predicate places. [2022-01-19 03:55:26,784 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 451 transitions, 3988 flow [2022-01-19 03:55:26,785 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-19 03:55:26,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:26,785 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-19 03:55:26,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 03:55:26,997 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-19 03:55:26,998 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-19 03:55:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2029778237, now seen corresponding path program 2 times [2022-01-19 03:55:26,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:26,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118994949] [2022-01-19 03:55:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:26,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:28,159 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-19 03:55:28,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118994949] [2022-01-19 03:55:28,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118994949] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:55:28,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832851971] [2022-01-19 03:55:28,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:55:28,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:55:28,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:55:28,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:55:28,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 03:55:28,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 03:55:28,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:55:28,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 03:55:28,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:55:28,429 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 03:55:28,429 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-19 03:55:28,448 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 03:55:28,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 03:55:29,303 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-19 03:55:29,441 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-19 03:55:30,319 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-19 03:55:30,542 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-19 03:55:30,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:55:31,113 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-19 03:55:31,136 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:55:31,136 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-19 03:55:31,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:55:31,145 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-19 03:55:31,149 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-19 03:55:32,216 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 03:55:32,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 03:55:32,227 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-19 03:55:32,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832851971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:55:32,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:55:32,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-01-19 03:55:32,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491904393] [2022-01-19 03:55:32,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:55:32,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-19 03:55:32,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-19 03:55:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-01-19 03:55:32,234 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 03:55:32,237 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-19 03:55:32,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:32,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 03:55:32,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:57:08,043 INFO L129 PetriNetUnfolder]: 8917/37452 cut-off events. [2022-01-19 03:57:08,043 INFO L130 PetriNetUnfolder]: For 81368/81376 co-relation queries the response was YES. [2022-01-19 03:57:08,725 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-19 03:57:08,837 INFO L132 encePairwiseOnDemand]: 131/176 looper letters, 1719 selfloop transitions, 1381 changer transitions 82/3258 dead transitions. [2022-01-19 03:57:08,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 3258 transitions, 29145 flow [2022-01-19 03:57:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2022-01-19 03:57:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2022-01-19 03:57:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 41974 transitions. [2022-01-19 03:57:08,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49685132575757573 [2022-01-19 03:57:08,889 INFO L72 ComplementDD]: Start complementDD. Operand 480 states and 41974 transitions. [2022-01-19 03:57:08,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 41974 transitions. [2022-01-19 03:57:08,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:57:08,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 480 states and 41974 transitions. [2022-01-19 03:57:08,972 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-19 03:57:09,068 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-19 03:57:09,099 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-19 03:57:09,100 INFO L186 Difference]: Start difference. First operand has 426 places, 451 transitions, 3988 flow. Second operand 480 states and 41974 transitions. [2022-01-19 03:57:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 3258 transitions, 29145 flow [2022-01-19 03:57:09,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 3258 transitions, 26379 flow, removed 1323 selfloop flow, removed 9 redundant places. [2022-01-19 03:57:09,536 INFO L242 Difference]: Finished difference. Result has 991 places, 1779 transitions, 18335 flow [2022-01-19 03:57:09,537 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-19 03:57:09,537 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 830 predicate places. [2022-01-19 03:57:09,538 INFO L470 AbstractCegarLoop]: Abstraction has has 991 places, 1779 transitions, 18335 flow [2022-01-19 03:57:09,539 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-19 03:57:09,539 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:57:09,539 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-19 03:57:09,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 03:57:09,758 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-19 03:57:09,758 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-19 03:57:09,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:57:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-01-19 03:57:09,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:57:09,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988638934] [2022-01-19 03:57:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:57:09,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:57:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:57:09,867 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-19 03:57:09,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:57:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988638934] [2022-01-19 03:57:09,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988638934] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:57:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849649493] [2022-01-19 03:57:09,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:57:09,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:57:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:57:09,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:57:09,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 03:57:09,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 03:57:09,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:57:09,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 03:57:09,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:57:10,326 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-19 03:57:10,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:57:10,636 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-19 03:57:10,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849649493] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:57:10,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:57:10,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-01-19 03:57:10,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125975861] [2022-01-19 03:57:10,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:57:10,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 03:57:10,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:57:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 03:57:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-19 03:57:10,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-19 03:57:10,641 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-19 03:57:10,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:57:10,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-19 03:57:10,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:57:22,712 INFO L129 PetriNetUnfolder]: 2163/25733 cut-off events. [2022-01-19 03:57:22,712 INFO L130 PetriNetUnfolder]: For 109446/109940 co-relation queries the response was YES. [2022-01-19 03:57:23,197 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-19 03:57:23,262 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 453 selfloop transitions, 315 changer transitions 1/2007 dead transitions. [2022-01-19 03:57:23,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 2007 transitions, 22275 flow [2022-01-19 03:57:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 03:57:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 03:57:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2795 transitions. [2022-01-19 03:57:23,265 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.882260101010101 [2022-01-19 03:57:23,265 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2795 transitions. [2022-01-19 03:57:23,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2795 transitions. [2022-01-19 03:57:23,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:57:23,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2795 transitions. [2022-01-19 03:57:23,269 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-19 03:57:23,271 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-19 03:57:23,271 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-19 03:57:23,272 INFO L186 Difference]: Start difference. First operand has 991 places, 1779 transitions, 18335 flow. Second operand 18 states and 2795 transitions. [2022-01-19 03:57:23,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 2007 transitions, 22275 flow [2022-01-19 03:57:24,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 2007 transitions, 20004 flow, removed 790 selfloop flow, removed 20 redundant places. [2022-01-19 03:57:24,289 INFO L242 Difference]: Finished difference. Result has 968 places, 1841 transitions, 17628 flow [2022-01-19 03:57:24,291 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-19 03:57:24,292 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 807 predicate places. [2022-01-19 03:57:24,292 INFO L470 AbstractCegarLoop]: Abstraction has has 968 places, 1841 transitions, 17628 flow [2022-01-19 03:57:24,293 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-19 03:57:24,293 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:57:24,293 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-19 03:57:24,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 03:57:24,503 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-19 03:57:24,503 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-19 03:57:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:57:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -958159694, now seen corresponding path program 1 times [2022-01-19 03:57:24,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:57:24,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212556179] [2022-01-19 03:57:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:57:24,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:57:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:57:25,389 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-19 03:57:25,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:57:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212556179] [2022-01-19 03:57:25,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212556179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:57:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081479319] [2022-01-19 03:57:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:57:25,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:57:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:57:25,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:57:25,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 03:57:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:57:25,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-19 03:57:25,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:57:26,367 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-19 03:57:27,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:57:27,330 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-19 03:57:28,967 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-19 03:57:29,179 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-19 03:57:29,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:57:55,331 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:57:55,332 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-19 03:57:55,339 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:57:55,339 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-19 03:57:55,356 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-19 03:57:55,372 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:57:55,373 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-19 03:57:56,390 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-19 03:57:56,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081479319] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:57:56,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:57:56,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-01-19 03:57:56,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984716549] [2022-01-19 03:57:56,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:57:56,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-19 03:57:56,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:57:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-19 03:57:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=7655, Unknown=22, NotChecked=0, Total=8372 [2022-01-19 03:57:56,398 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 03:57:56,403 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-19 03:57:56,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:57:56,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 03:57:56,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:58:15,343 WARN L228 SmtUtils]: Spent 5.53s 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-19 03:58:53,042 WARN L228 SmtUtils]: Spent 11.38s 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-19 04:00:10,237 WARN L228 SmtUtils]: Spent 6.01s 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-19 04:00:34,788 WARN L228 SmtUtils]: Spent 6.09s 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-19 04:01:42,268 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-19 04:02:07,996 WARN L228 SmtUtils]: Spent 8.03s 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-19 04:04:16,267 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-19 04:04:39,072 WARN L228 SmtUtils]: Spent 8.04s 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-19 04:05:08,864 INFO L129 PetriNetUnfolder]: 19298/84519 cut-off events. [2022-01-19 04:05:08,865 INFO L130 PetriNetUnfolder]: For 1049620/1049625 co-relation queries the response was YES. [2022-01-19 04:05:12,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 380086 conditions, 84519 events. 19298/84519 cut-off events. For 1049620/1049625 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 1031693 event pairs, 4453 based on Foata normal form. 281/83316 useless extension candidates. Maximal degree in co-relation 377945. Up to 19053 conditions per place. [2022-01-19 04:05:13,414 INFO L132 encePairwiseOnDemand]: 132/176 looper letters, 4130 selfloop transitions, 1711 changer transitions 88/6015 dead transitions. [2022-01-19 04:05:13,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1149 places, 6015 transitions, 67038 flow [2022-01-19 04:05:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-01-19 04:05:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2022-01-19 04:05:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 18684 transitions. [2022-01-19 04:05:13,433 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5832917082917083 [2022-01-19 04:05:13,433 INFO L72 ComplementDD]: Start complementDD. Operand 182 states and 18684 transitions. [2022-01-19 04:05:13,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 18684 transitions. [2022-01-19 04:05:13,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:05:13,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 182 states and 18684 transitions. [2022-01-19 04:05:13,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 183 states, 182 states have (on average 102.65934065934066) internal successors, (18684), 182 states have internal predecessors, (18684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:13,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 183 states, 183 states have (on average 176.0) internal successors, (32208), 183 states have internal predecessors, (32208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:13,494 INFO L81 ComplementDD]: Finished complementDD. Result has 183 states, 183 states have (on average 176.0) internal successors, (32208), 183 states have internal predecessors, (32208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:05:13,494 INFO L186 Difference]: Start difference. First operand has 968 places, 1841 transitions, 17628 flow. Second operand 182 states and 18684 transitions. [2022-01-19 04:05:13,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1149 places, 6015 transitions, 67038 flow [2022-01-19 04:05:18,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1139 places, 6015 transitions, 65460 flow, removed 310 selfloop flow, removed 10 redundant places. [2022-01-19 04:05:18,672 INFO L242 Difference]: Finished difference. Result has 1245 places, 3334 transitions, 39001 flow [2022-01-19 04:05:18,674 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=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=182, PETRI_FLOW=39001, PETRI_PLACES=1245, PETRI_TRANSITIONS=3334} [2022-01-19 04:05:18,675 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 1084 predicate places. [2022-01-19 04:05:18,675 INFO L470 AbstractCegarLoop]: Abstraction has has 1245 places, 3334 transitions, 39001 flow [2022-01-19 04:05:18,676 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-19 04:05:18,676 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:05:18,676 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-19 04:05:18,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 04:05:18,876 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-19 04:05:18,877 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-19 04:05:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:05:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 127973202, now seen corresponding path program 2 times [2022-01-19 04:05:18,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:05:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952035361] [2022-01-19 04:05:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:05:18,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:05:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:05:19,843 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-19 04:05:19,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:05:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952035361] [2022-01-19 04:05:19,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952035361] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:05:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152868652] [2022-01-19 04:05:19,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:05:19,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:05:19,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:05:19,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:05:19,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 04:05:19,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:05:19,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:05:19,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-19 04:05:19,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:05:20,765 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-19 04:05:21,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:05:21,701 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-19 04:05:23,341 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-19 04:05:23,551 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-19 04:05:23,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:05:26,589 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-19 04:06:13,872 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-19 04:06:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-19 04:06:14,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152868652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:06:14,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:06:14,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 29] total 86 [2022-01-19 04:06:14,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758623353] [2022-01-19 04:06:14,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:06:14,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-19 04:06:14,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:06:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-19 04:06:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=6824, Unknown=20, NotChecked=166, Total=7310 [2022-01-19 04:06:14,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 04:06:14,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1245 places, 3334 transitions, 39001 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-19 04:06:14,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:06:14,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 04:06:14,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:06:24,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse5 (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 (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse4 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_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse4) (< |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) .cse5)) (= 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-19 04:06:28,608 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-19 04:06:51,465 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_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |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_~#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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .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-19 04:06:56,089 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_~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_~#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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |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|) (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-19 04:06:58,732 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-19 04:07:30,307 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) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .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_~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_~#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) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (= 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-19 04:07:32,340 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)) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .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_~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_~#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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (= 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-19 04:07:35,856 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_~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_~#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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |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|) (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 Received shutdown request... [2022-01-19 04:08:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 272 states. [2022-01-19 04:08:22,654 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:08:22,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 04:08:22,678 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-19 04:08:22,678 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 04:08:22,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:08:22,855 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 341 known predicates. [2022-01-19 04:08:22,856 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-01-19 04:08:22,857 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:08:22,857 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-19 04:08:22,857 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-19 04:08:22,857 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:08:22,859 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 04:08:22,863 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:08:22,863 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:08:22,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:08:22 BasicIcfg [2022-01-19 04:08:22,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:08:22,867 INFO L158 Benchmark]: Toolchain (without parser) took 807356.14ms. Allocated memory was 367.0MB in the beginning and 12.0GB in the end (delta: 11.6GB). Free memory was 310.0MB in the beginning and 7.1GB in the end (delta: -6.8GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2022-01-19 04:08:22,867 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 328.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:08:22,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.54ms. Allocated memory was 367.0MB in the beginning and 497.0MB in the end (delta: 130.0MB). Free memory was 309.9MB in the beginning and 449.6MB in the end (delta: -139.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.0GB. [2022-01-19 04:08:22,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.73ms. Allocated memory is still 497.0MB. Free memory was 449.6MB in the beginning and 446.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:08:22,867 INFO L158 Benchmark]: Boogie Preprocessor took 23.36ms. Allocated memory is still 497.0MB. Free memory was 446.4MB in the beginning and 445.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:08:22,868 INFO L158 Benchmark]: RCFGBuilder took 452.62ms. Allocated memory is still 497.0MB. Free memory was 445.4MB in the beginning and 428.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 04:08:22,868 INFO L158 Benchmark]: TraceAbstraction took 806309.23ms. Allocated memory was 497.0MB in the beginning and 12.0GB in the end (delta: 11.5GB). Free memory was 427.6MB in the beginning and 7.1GB in the end (delta: -6.6GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2022-01-19 04:08:22,872 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 328.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 509.54ms. Allocated memory was 367.0MB in the beginning and 497.0MB in the end (delta: 130.0MB). Free memory was 309.9MB in the beginning and 449.6MB in the end (delta: -139.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.73ms. Allocated memory is still 497.0MB. Free memory was 449.6MB in the beginning and 446.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.36ms. Allocated memory is still 497.0MB. Free memory was 446.4MB in the beginning and 445.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 452.62ms. Allocated memory is still 497.0MB. Free memory was 445.4MB in the beginning and 428.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 806309.23ms. Allocated memory was 497.0MB in the beginning and 12.0GB in the end (delta: 11.5GB). Free memory was 427.6MB in the beginning and 7.1GB in the end (delta: -6.6GB). Peak memory consumption was 4.9GB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 341 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 341 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 341 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 341 known predicates. - 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: 806.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 702.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14041 SdHoareTripleChecker+Valid, 27.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14041 mSDsluCounter, 17210 SdHoareTripleChecker+Invalid, 23.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9242 IncrementalHoareTripleChecker+Unchecked, 23472 mSDsCounter, 969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43459 IncrementalHoareTripleChecker+Invalid, 53670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 969 mSolverCounterUnsat, 717 mSDtfsCounter, 43459 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3523 GetRequests, 1963 SyntacticMatches, 77 SemanticMatches, 1482 ConstructedPredicates, 10 IntricatePredicates, 5 DeprecatedPredicates, 198771 ImplicationChecksByTransitivity, 629.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39001occurred in iteration=12, InterpolantAutomatonStates: 898, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 100.9s 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