/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-After.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 10:16:13,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:16:13,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:16:13,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:16:13,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:16:13,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:16:13,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:16:13,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:16:13,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:16:13,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:16:13,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:16:13,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:16:13,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:16:13,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:16:13,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:16:13,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:16:13,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:16:13,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:16:13,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:16:13,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:16:13,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:16:13,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:16:13,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:16:13,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:16:13,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:16:13,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:16:13,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:16:13,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:16:13,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:16:13,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:16:13,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:16:13,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:16:13,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:16:13,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:16:13,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:16:13,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:16:13,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:16:13,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:16:13,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:16:13,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:16:13,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:16:13,770 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-After.epf [2022-01-19 10:16:13,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:16:13,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:16:13,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:16:13,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:16:13,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:16:13,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:16:13,795 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:16:13,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:16:13,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:16:13,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:16:13,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:16:13,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:16:13,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:16:13,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:16:13,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:16:13,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:16:13,798 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:16:13,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:16:13,798 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:16:13,798 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 10:16:13,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:16:13,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:16:13,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:16:13,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:16:13,985 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:16:13,986 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 10:16:14,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30249cab/de1385e540f74ceebab03dd55bef87ac/FLAG3d0a6402b [2022-01-19 10:16:14,434 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:16:14,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-01-19 10:16:14,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30249cab/de1385e540f74ceebab03dd55bef87ac/FLAG3d0a6402b [2022-01-19 10:16:14,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30249cab/de1385e540f74ceebab03dd55bef87ac [2022-01-19 10:16:14,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:16:14,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:16:14,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:16:14,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:16:14,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:16:14,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfa81a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14, skipping insertion in model container [2022-01-19 10:16:14,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:16:14,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:16:14,809 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 10:16:14,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:16:14,841 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:16:14,868 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 10:16:14,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:16:14,918 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:16:14,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14 WrapperNode [2022-01-19 10:16:14,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:16:14,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:16:14,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:16:14,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:16:14,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,966 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-01-19 10:16:14,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:16:14,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:16:14,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:16:14,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:16:14,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:16:14,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:16:14,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:16:14,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:16:14,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (1/1) ... [2022-01-19 10:16:14,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:16:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:16:15,020 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 10:16:15,026 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 10:16:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 10:16:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 10:16:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 10:16:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 10:16:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:16:15,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:16:15,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:16:15,051 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 10:16:15,146 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:16:15,147 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:16:15,421 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:16:15,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:16:15,426 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 10:16:15,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:16:15 BoogieIcfgContainer [2022-01-19 10:16:15,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:16:15,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:16:15,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:16:15,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:16:15,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:16:14" (1/3) ... [2022-01-19 10:16:15,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a5e20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:16:15, skipping insertion in model container [2022-01-19 10:16:15,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:16:14" (2/3) ... [2022-01-19 10:16:15,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a5e20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:16:15, skipping insertion in model container [2022-01-19 10:16:15,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:16:15" (3/3) ... [2022-01-19 10:16:15,433 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-01-19 10:16:15,436 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:16:15,436 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 10:16:15,436 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,470 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,471 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 10:16:15,472 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,472 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 10:16:15,472 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 10:16:15,472 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 10:16:15,472 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 10:16:15,472 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 10:16:15,472 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 10:16:15,472 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 10:16:15,473 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 10:16:15,473 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 10:16:15,473 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 10:16:15,473 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 10:16:15,473 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,473 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,473 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,473 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,474 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,475 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,476 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,477 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,478 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,479 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,480 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,481 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,482 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,483 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,484 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,485 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,486 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,487 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,488 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,489 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,490 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,491 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,492 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,493 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,494 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,495 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,496 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,497 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,499 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,499 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,499 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 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,500 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,501 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 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,503 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,504 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:16:15,506 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 10:16:15,534 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:16:15,538 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 10:16:15,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 10:16:15,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2022-01-19 10:16:15,595 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2022-01-19 10:16:15,595 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 10:16:15,600 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 10:16:15,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 176 transitions, 368 flow [2022-01-19 10:16:15,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 164 transitions, 337 flow [2022-01-19 10:16:15,634 INFO L129 PetriNetUnfolder]: 5/130 cut-off events. [2022-01-19 10:16:15,635 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 10:16:15,635 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:15,635 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 10:16:15,636 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 10:16:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-01-19 10:16:15,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:15,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693426847] [2022-01-19 10:16:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:15,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:15,901 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 10:16:15,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:15,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693426847] [2022-01-19 10:16:15,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693426847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:15,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:15,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:16:15,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693107306] [2022-01-19 10:16:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:15,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:16:15,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:16:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:16:15,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-19 10:16:15,942 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 10:16:15,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:15,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-19 10:16:15,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:16,082 INFO L129 PetriNetUnfolder]: 88/703 cut-off events. [2022-01-19 10:16:16,082 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 10:16:16,086 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 10:16:16,089 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2022-01-19 10:16:16,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 385 flow [2022-01-19 10:16:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:16:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:16:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-01-19 10:16:16,102 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9299242424242424 [2022-01-19 10:16:16,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-01-19 10:16:16,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-01-19 10:16:16,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:16,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-01-19 10:16:16,110 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 10:16:16,115 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 10:16:16,115 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 10:16:16,116 INFO L186 Difference]: Start difference. First operand has 161 places, 164 transitions, 337 flow. Second operand 3 states and 491 transitions. [2022-01-19 10:16:16,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 385 flow [2022-01-19 10:16:16,121 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 10:16:16,124 INFO L242 Difference]: Finished difference. Result has 157 places, 156 transitions, 331 flow [2022-01-19 10:16:16,125 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 10:16:16,129 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, -4 predicate places. [2022-01-19 10:16:16,129 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 331 flow [2022-01-19 10:16:16,130 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 10:16:16,134 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:16,134 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 10:16:16,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:16:16,135 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 10:16:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-01-19 10:16:16,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:16,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239508746] [2022-01-19 10:16:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:16,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:16,209 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 10:16:16,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:16,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239508746] [2022-01-19 10:16:16,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239508746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:16,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:16,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:16:16,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45657253] [2022-01-19 10:16:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:16,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:16:16,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:16:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:16:16,214 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 176 [2022-01-19 10:16:16,215 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 10:16:16,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:16,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 176 [2022-01-19 10:16:16,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:16,303 INFO L129 PetriNetUnfolder]: 34/594 cut-off events. [2022-01-19 10:16:16,303 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 10:16:16,306 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 10:16:16,307 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 16 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-01-19 10:16:16,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 392 flow [2022-01-19 10:16:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:16:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:16:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-01-19 10:16:16,310 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9161931818181818 [2022-01-19 10:16:16,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-01-19 10:16:16,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-01-19 10:16:16,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:16,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-01-19 10:16:16,312 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 10:16:16,314 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 10:16:16,314 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 10:16:16,314 INFO L186 Difference]: Start difference. First operand has 157 places, 156 transitions, 331 flow. Second operand 4 states and 645 transitions. [2022-01-19 10:16:16,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 392 flow [2022-01-19 10:16:16,317 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 10:16:16,320 INFO L242 Difference]: Finished difference. Result has 161 places, 159 transitions, 356 flow [2022-01-19 10:16:16,320 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 10:16:16,321 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2022-01-19 10:16:16,321 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 356 flow [2022-01-19 10:16:16,321 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 10:16:16,322 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:16,322 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 10:16:16,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:16:16,322 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 10:16:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1664854431, now seen corresponding path program 1 times [2022-01-19 10:16:16,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:16,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246220518] [2022-01-19 10:16:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:16,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:16,418 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 10:16:16,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246220518] [2022-01-19 10:16:16,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246220518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:16,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:16,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:16:16,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245023877] [2022-01-19 10:16:16,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:16,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:16:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:16,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:16:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:16:16,420 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2022-01-19 10:16:16,421 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 10:16:16,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:16,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2022-01-19 10:16:16,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:16,579 INFO L129 PetriNetUnfolder]: 127/1271 cut-off events. [2022-01-19 10:16:16,579 INFO L130 PetriNetUnfolder]: For 90/100 co-relation queries the response was YES. [2022-01-19 10:16:16,582 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 10:16:16,584 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 25 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2022-01-19 10:16:16,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 447 flow [2022-01-19 10:16:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:16:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:16:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-01-19 10:16:16,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9204545454545454 [2022-01-19 10:16:16,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2022-01-19 10:16:16,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2022-01-19 10:16:16,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:16,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2022-01-19 10:16:16,587 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 10:16:16,587 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 10:16:16,588 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 10:16:16,588 INFO L186 Difference]: Start difference. First operand has 161 places, 159 transitions, 356 flow. Second operand 3 states and 486 transitions. [2022-01-19 10:16:16,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 447 flow [2022-01-19 10:16:16,589 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 10:16:16,591 INFO L242 Difference]: Finished difference. Result has 164 places, 163 transitions, 396 flow [2022-01-19 10:16:16,591 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 10:16:16,592 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2022-01-19 10:16:16,592 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 396 flow [2022-01-19 10:16:16,592 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 10:16:16,592 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:16,592 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 10:16:16,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:16:16,593 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 10:16:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-01-19 10:16:16,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:16,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712530443] [2022-01-19 10:16:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:16,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:16,655 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 10:16:16,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712530443] [2022-01-19 10:16:16,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712530443] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:16:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354455930] [2022-01-19 10:16:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:16,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:16:16,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:16:16,657 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 10:16:16,658 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 10:16:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:16,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 10:16:16,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:16:16,975 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 10:16:16,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:16:17,153 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 10:16:17,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354455930] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:16:17,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:16:17,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 10:16:17,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619053832] [2022-01-19 10:16:17,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:16:17,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:16:17,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:16:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:16:17,156 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-19 10:16:17,157 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 10:16:17,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:17,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-19 10:16:17,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:17,596 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 10:16:17,596 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-19 10:16:17,596 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-19 10:16:17,596 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-19 10:16:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-19 10:16:17,597 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 10:16:17,597 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-01-19 10:16:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-01-19 10:16:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-01-19 10:16:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-01-19 10:16:17,644 INFO L129 PetriNetUnfolder]: 387/3002 cut-off events. [2022-01-19 10:16:17,644 INFO L130 PetriNetUnfolder]: For 1007/1065 co-relation queries the response was YES. [2022-01-19 10:16:17,697 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 10:16:17,706 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 86 selfloop transitions, 46 changer transitions 1/273 dead transitions. [2022-01-19 10:16:17,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 1078 flow [2022-01-19 10:16:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 10:16:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 10:16:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2831 transitions. [2022-01-19 10:16:17,711 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8936237373737373 [2022-01-19 10:16:17,711 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2831 transitions. [2022-01-19 10:16:17,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2831 transitions. [2022-01-19 10:16:17,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:17,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2831 transitions. [2022-01-19 10:16:17,717 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 10:16:17,721 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 10:16:17,722 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 10:16:17,722 INFO L186 Difference]: Start difference. First operand has 164 places, 163 transitions, 396 flow. Second operand 18 states and 2831 transitions. [2022-01-19 10:16:17,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 1078 flow [2022-01-19 10:16:17,725 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 10:16:17,728 INFO L242 Difference]: Finished difference. Result has 185 places, 218 transitions, 767 flow [2022-01-19 10:16:17,728 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 10:16:17,728 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 24 predicate places. [2022-01-19 10:16:17,729 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 218 transitions, 767 flow [2022-01-19 10:16:17,729 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 10:16:17,729 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:17,729 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 10:16:17,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 10:16:17,947 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 10:16:17,948 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 10:16:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 754166100, now seen corresponding path program 1 times [2022-01-19 10:16:17,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651736370] [2022-01-19 10:16:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:17,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:17,995 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 10:16:17,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:17,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651736370] [2022-01-19 10:16:17,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651736370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:17,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:17,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:16:17,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775193178] [2022-01-19 10:16:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:17,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:16:17,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:16:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:16:17,998 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2022-01-19 10:16:17,998 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 10:16:17,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:17,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2022-01-19 10:16:17,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:18,105 INFO L129 PetriNetUnfolder]: 54/1111 cut-off events. [2022-01-19 10:16:18,105 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-01-19 10:16:18,109 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 10:16:18,111 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 12 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2022-01-19 10:16:18,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 544 flow [2022-01-19 10:16:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:16:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:16:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-01-19 10:16:18,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2022-01-19 10:16:18,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2022-01-19 10:16:18,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2022-01-19 10:16:18,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:18,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2022-01-19 10:16:18,114 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 10:16:18,115 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 10:16:18,115 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 10:16:18,115 INFO L186 Difference]: Start difference. First operand has 185 places, 218 transitions, 767 flow. Second operand 3 states and 480 transitions. [2022-01-19 10:16:18,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 544 flow [2022-01-19 10:16:18,118 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 10:16:18,119 INFO L242 Difference]: Finished difference. Result has 175 places, 175 transitions, 491 flow [2022-01-19 10:16:18,119 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 10:16:18,120 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 14 predicate places. [2022-01-19 10:16:18,120 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 491 flow [2022-01-19 10:16:18,120 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 10:16:18,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:18,121 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 10:16:18,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:16:18,121 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 10:16:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 33999950, now seen corresponding path program 1 times [2022-01-19 10:16:18,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003975679] [2022-01-19 10:16:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:18,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:18,692 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 10:16:18,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:18,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003975679] [2022-01-19 10:16:18,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003975679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:18,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:18,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-19 10:16:18,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903119667] [2022-01-19 10:16:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:18,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 10:16:18,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 10:16:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-01-19 10:16:18,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 10:16:18,699 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 10:16:18,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:18,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 10:16:18,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:21,359 INFO L129 PetriNetUnfolder]: 1122/4498 cut-off events. [2022-01-19 10:16:21,359 INFO L130 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2022-01-19 10:16:21,374 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 10:16:21,389 INFO L132 encePairwiseOnDemand]: 139/176 looper letters, 249 selfloop transitions, 59 changer transitions 33/427 dead transitions. [2022-01-19 10:16:21,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 427 transitions, 1859 flow [2022-01-19 10:16:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 10:16:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 10:16:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4579 transitions. [2022-01-19 10:16:21,398 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5912964876033058 [2022-01-19 10:16:21,398 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4579 transitions. [2022-01-19 10:16:21,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4579 transitions. [2022-01-19 10:16:21,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:21,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4579 transitions. [2022-01-19 10:16:21,406 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 10:16:21,415 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 10:16:21,416 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 10:16:21,417 INFO L186 Difference]: Start difference. First operand has 175 places, 175 transitions, 491 flow. Second operand 44 states and 4579 transitions. [2022-01-19 10:16:21,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 427 transitions, 1859 flow [2022-01-19 10:16:21,420 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 10:16:21,424 INFO L242 Difference]: Finished difference. Result has 256 places, 230 transitions, 974 flow [2022-01-19 10:16:21,424 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 10:16:21,425 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 95 predicate places. [2022-01-19 10:16:21,425 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 230 transitions, 974 flow [2022-01-19 10:16:21,426 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 10:16:21,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:21,426 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 10:16:21,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:16:21,426 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 10:16:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1463024058, now seen corresponding path program 2 times [2022-01-19 10:16:21,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:21,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231438274] [2022-01-19 10:16:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:21,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:22,028 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 10:16:22,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231438274] [2022-01-19 10:16:22,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231438274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:22,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:22,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 10:16:22,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140200651] [2022-01-19 10:16:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:22,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 10:16:22,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 10:16:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-01-19 10:16:22,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 10:16:22,032 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 10:16:22,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:22,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 10:16:22,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:25,141 INFO L129 PetriNetUnfolder]: 1758/7143 cut-off events. [2022-01-19 10:16:25,141 INFO L130 PetriNetUnfolder]: For 5419/5421 co-relation queries the response was YES. [2022-01-19 10:16:25,168 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 10:16:25,185 INFO L132 encePairwiseOnDemand]: 138/176 looper letters, 288 selfloop transitions, 60 changer transitions 26/450 dead transitions. [2022-01-19 10:16:25,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 450 transitions, 2751 flow [2022-01-19 10:16:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 10:16:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 10:16:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3009 transitions. [2022-01-19 10:16:25,190 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5180785123966942 [2022-01-19 10:16:25,190 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3009 transitions. [2022-01-19 10:16:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3009 transitions. [2022-01-19 10:16:25,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:25,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3009 transitions. [2022-01-19 10:16:25,195 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 10:16:25,200 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 10:16:25,201 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 10:16:25,201 INFO L186 Difference]: Start difference. First operand has 256 places, 230 transitions, 974 flow. Second operand 33 states and 3009 transitions. [2022-01-19 10:16:25,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 450 transitions, 2751 flow [2022-01-19 10:16:25,216 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 10:16:25,220 INFO L242 Difference]: Finished difference. Result has 302 places, 265 transitions, 1447 flow [2022-01-19 10:16:25,220 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 10:16:25,220 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 141 predicate places. [2022-01-19 10:16:25,221 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 265 transitions, 1447 flow [2022-01-19 10:16:25,221 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 10:16:25,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:25,222 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 10:16:25,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 10:16:25,222 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 10:16:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1698324662, now seen corresponding path program 3 times [2022-01-19 10:16:25,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710037788] [2022-01-19 10:16:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:25,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:25,986 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 10:16:25,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:25,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710037788] [2022-01-19 10:16:25,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710037788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:16:25,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:16:25,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 10:16:25,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052789420] [2022-01-19 10:16:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:25,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 10:16:25,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 10:16:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-01-19 10:16:25,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 10:16:25,990 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 10:16:25,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:25,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 10:16:25,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:30,139 INFO L129 PetriNetUnfolder]: 2158/8843 cut-off events. [2022-01-19 10:16:30,140 INFO L130 PetriNetUnfolder]: For 9626/9629 co-relation queries the response was YES. [2022-01-19 10:16:30,179 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 10:16:30,197 INFO L132 encePairwiseOnDemand]: 140/176 looper letters, 263 selfloop transitions, 126 changer transitions 33/498 dead transitions. [2022-01-19 10:16:30,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 498 transitions, 3350 flow [2022-01-19 10:16:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-19 10:16:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-19 10:16:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4052 transitions. [2022-01-19 10:16:30,201 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5116161616161616 [2022-01-19 10:16:30,201 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4052 transitions. [2022-01-19 10:16:30,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4052 transitions. [2022-01-19 10:16:30,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:30,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4052 transitions. [2022-01-19 10:16:30,216 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 10:16:30,222 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 10:16:30,223 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 10:16:30,223 INFO L186 Difference]: Start difference. First operand has 302 places, 265 transitions, 1447 flow. Second operand 45 states and 4052 transitions. [2022-01-19 10:16:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 498 transitions, 3350 flow [2022-01-19 10:16:30,247 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 10:16:30,253 INFO L242 Difference]: Finished difference. Result has 359 places, 301 transitions, 2187 flow [2022-01-19 10:16:30,254 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 10:16:30,256 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 198 predicate places. [2022-01-19 10:16:30,256 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 301 transitions, 2187 flow [2022-01-19 10:16:30,256 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 10:16:30,256 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:30,257 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 10:16:30,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 10:16:30,257 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 10:16:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1159186773, now seen corresponding path program 1 times [2022-01-19 10:16:30,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:30,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19205728] [2022-01-19 10:16:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:30,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:30,814 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 10:16:30,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19205728] [2022-01-19 10:16:30,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19205728] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:16:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457083180] [2022-01-19 10:16:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:30,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:16:30,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:16:30,816 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 10:16:30,817 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 10:16:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 10:16:30,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:16:32,180 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 10:16:33,125 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 10:16:33,294 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 10:16:33,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:16:33,825 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 10:16:34,414 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 10:16:34,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457083180] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 10:16:34,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 10:16:34,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-01-19 10:16:34,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876932449] [2022-01-19 10:16:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:16:34,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 10:16:34,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 10:16:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4313, Unknown=0, NotChecked=0, Total=4556 [2022-01-19 10:16:34,423 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 10:16:34,424 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 10:16:34,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:34,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 10:16:34,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:41,194 INFO L129 PetriNetUnfolder]: 3191/13252 cut-off events. [2022-01-19 10:16:41,194 INFO L130 PetriNetUnfolder]: For 24497/24497 co-relation queries the response was YES. [2022-01-19 10:16:41,297 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 10:16:41,326 INFO L132 encePairwiseOnDemand]: 143/176 looper letters, 286 selfloop transitions, 255 changer transitions 3/630 dead transitions. [2022-01-19 10:16:41,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 630 transitions, 5256 flow [2022-01-19 10:16:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-19 10:16:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-19 10:16:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 6634 transitions. [2022-01-19 10:16:41,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5798951048951049 [2022-01-19 10:16:41,333 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 6634 transitions. [2022-01-19 10:16:41,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 6634 transitions. [2022-01-19 10:16:41,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:41,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 6634 transitions. [2022-01-19 10:16:41,344 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 10:16:41,354 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 10:16:41,355 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 10:16:41,355 INFO L186 Difference]: Start difference. First operand has 359 places, 301 transitions, 2187 flow. Second operand 65 states and 6634 transitions. [2022-01-19 10:16:41,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 630 transitions, 5256 flow [2022-01-19 10:16:41,432 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 10:16:41,439 INFO L242 Difference]: Finished difference. Result has 426 places, 451 transitions, 3988 flow [2022-01-19 10:16:41,440 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 10:16:41,440 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 265 predicate places. [2022-01-19 10:16:41,440 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 451 transitions, 3988 flow [2022-01-19 10:16:41,441 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 10:16:41,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:41,441 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 10:16:41,458 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 10:16:41,655 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 10:16:41,656 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 10:16:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2029778237, now seen corresponding path program 2 times [2022-01-19 10:16:41,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:41,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933275788] [2022-01-19 10:16:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:41,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:16:42,624 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 10:16:42,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:16:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933275788] [2022-01-19 10:16:42,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933275788] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:16:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868553593] [2022-01-19 10:16:42,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:16:42,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:16:42,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:16:42,625 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 10:16:42,632 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 10:16:42,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 10:16:42,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:16:42,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 10:16:42,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:16:42,838 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 10:16:42,838 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 10:16:42,849 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 10:16:42,849 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 10:16:43,547 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 10:16:43,656 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 10:16:44,367 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 10:16:44,554 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 10:16:44,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:16:45,164 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 10:16:45,219 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:16:45,220 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 10:16:45,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:16:45,239 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 10:16:45,242 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 10:16:46,117 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 10:16:46,117 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 10:16:46,126 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 10:16:46,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868553593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:16:46,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:16:46,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-01-19 10:16:46,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361738638] [2022-01-19 10:16:46,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:16:46,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-19 10:16:46,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:16:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-19 10:16:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-01-19 10:16:46,132 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 176 [2022-01-19 10:16:46,135 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 10:16:46,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:16:46,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 176 [2022-01-19 10:16:46,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:18:16,574 INFO L129 PetriNetUnfolder]: 8917/37452 cut-off events. [2022-01-19 10:18:16,574 INFO L130 PetriNetUnfolder]: For 81368/81376 co-relation queries the response was YES. [2022-01-19 10:18:17,015 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 10:18:17,104 INFO L132 encePairwiseOnDemand]: 131/176 looper letters, 1719 selfloop transitions, 1381 changer transitions 82/3258 dead transitions. [2022-01-19 10:18:17,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 3258 transitions, 29145 flow [2022-01-19 10:18:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 480 states. [2022-01-19 10:18:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2022-01-19 10:18:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 41974 transitions. [2022-01-19 10:18:17,140 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49685132575757573 [2022-01-19 10:18:17,140 INFO L72 ComplementDD]: Start complementDD. Operand 480 states and 41974 transitions. [2022-01-19 10:18:17,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 41974 transitions. [2022-01-19 10:18:17,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:18:17,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 480 states and 41974 transitions. [2022-01-19 10:18:17,201 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 10:18:17,281 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 10:18:17,308 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 10:18:17,308 INFO L186 Difference]: Start difference. First operand has 426 places, 451 transitions, 3988 flow. Second operand 480 states and 41974 transitions. [2022-01-19 10:18:17,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 3258 transitions, 29145 flow [2022-01-19 10:18:17,703 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 10:18:17,729 INFO L242 Difference]: Finished difference. Result has 991 places, 1779 transitions, 18335 flow [2022-01-19 10:18:17,730 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 10:18:17,730 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 830 predicate places. [2022-01-19 10:18:17,730 INFO L470 AbstractCegarLoop]: Abstraction has has 991 places, 1779 transitions, 18335 flow [2022-01-19 10:18:17,731 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 10:18:17,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:18:17,731 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 10:18:17,753 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 10:18:17,937 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 10:18:17,937 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 10:18:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:18:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-01-19 10:18:17,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:18:17,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671968524] [2022-01-19 10:18:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:18:17,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:18:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:18:18,016 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 10:18:18,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:18:18,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671968524] [2022-01-19 10:18:18,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671968524] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:18:18,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847287559] [2022-01-19 10:18:18,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:18:18,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:18:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:18:18,018 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 10:18:18,020 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 10:18:18,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 10:18:18,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:18:18,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 10:18:18,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:18:18,385 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 10:18:18,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:18:18,640 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 10:18:18,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847287559] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:18:18,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:18:18,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-01-19 10:18:18,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636716699] [2022-01-19 10:18:18,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:18:18,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 10:18:18,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:18:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 10:18:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-19 10:18:18,643 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2022-01-19 10:18:18,644 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 10:18:18,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:18:18,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2022-01-19 10:18:18,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:18:29,512 INFO L129 PetriNetUnfolder]: 2163/25733 cut-off events. [2022-01-19 10:18:29,512 INFO L130 PetriNetUnfolder]: For 109446/109940 co-relation queries the response was YES. [2022-01-19 10:18:30,071 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 10:18:30,133 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 453 selfloop transitions, 315 changer transitions 1/2007 dead transitions. [2022-01-19 10:18:30,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 2007 transitions, 22275 flow [2022-01-19 10:18:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 10:18:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 10:18:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2795 transitions. [2022-01-19 10:18:30,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.882260101010101 [2022-01-19 10:18:30,136 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2795 transitions. [2022-01-19 10:18:30,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2795 transitions. [2022-01-19 10:18:30,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:18:30,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2795 transitions. [2022-01-19 10:18:30,139 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 10:18:30,141 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 10:18:30,142 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 10:18:30,142 INFO L186 Difference]: Start difference. First operand has 991 places, 1779 transitions, 18335 flow. Second operand 18 states and 2795 transitions. [2022-01-19 10:18:30,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 2007 transitions, 22275 flow [2022-01-19 10:18:31,055 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 10:18:31,077 INFO L242 Difference]: Finished difference. Result has 968 places, 1841 transitions, 17628 flow [2022-01-19 10:18:31,079 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 10:18:31,079 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 807 predicate places. [2022-01-19 10:18:31,079 INFO L470 AbstractCegarLoop]: Abstraction has has 968 places, 1841 transitions, 17628 flow [2022-01-19 10:18:31,080 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 10:18:31,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:18:31,080 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 10:18:31,096 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 10:18:31,292 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 10:18:31,292 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 10:18:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:18:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -958159694, now seen corresponding path program 1 times [2022-01-19 10:18:31,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:18:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984678736] [2022-01-19 10:18:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:18:31,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:18:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:18:32,013 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 10:18:32,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:18:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984678736] [2022-01-19 10:18:32,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984678736] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:18:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414695574] [2022-01-19 10:18:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:18:32,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:18:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:18:32,014 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 10:18:32,015 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 10:18:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:18:32,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-19 10:18:32,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:18:32,918 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 10:18:33,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 10:18:33,866 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 10:18:35,453 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 10:18:35,621 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 10:18:35,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:19:01,188 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:19:01,189 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 10:19:01,194 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:19:01,195 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 10:19:01,207 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 10:19:01,222 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:19:01,223 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 10:19:02,213 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 10:19:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414695574] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:19:02,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:19:02,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-01-19 10:19:02,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711231741] [2022-01-19 10:19:02,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:19:02,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-19 10:19:02,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-19 10:19:02,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=7655, Unknown=22, NotChecked=0, Total=8372 [2022-01-19 10:19:02,219 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 10:19:02,223 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 10:19:02,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:02,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 10:19:02,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:21,408 WARN L228 SmtUtils]: Spent 5.99s 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 10:19:57,493 WARN L228 SmtUtils]: Spent 11.30s 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 10:21:24,548 WARN L228 SmtUtils]: Spent 8.02s 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 10:22:45,527 WARN L228 SmtUtils]: Spent 8.02s 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 10:24:36,044 WARN L228 SmtUtils]: Spent 5.81s 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 10:25:06,913 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 10:25:36,991 INFO L129 PetriNetUnfolder]: 19462/85175 cut-off events. [2022-01-19 10:25:36,991 INFO L130 PetriNetUnfolder]: For 1052347/1052352 co-relation queries the response was YES. [2022-01-19 10:25:40,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382411 conditions, 85175 events. 19462/85175 cut-off events. For 1052347/1052352 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 1041988 event pairs, 4457 based on Foata normal form. 281/83956 useless extension candidates. Maximal degree in co-relation 380270. Up to 19069 conditions per place. [2022-01-19 10:25:40,846 INFO L132 encePairwiseOnDemand]: 132/176 looper letters, 4171 selfloop transitions, 1769 changer transitions 88/6114 dead transitions. [2022-01-19 10:25:40,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1150 places, 6114 transitions, 68168 flow [2022-01-19 10:25:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-01-19 10:25:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2022-01-19 10:25:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 18785 transitions. [2022-01-19 10:25:40,861 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5832401887729757 [2022-01-19 10:25:40,861 INFO L72 ComplementDD]: Start complementDD. Operand 183 states and 18785 transitions. [2022-01-19 10:25:40,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 18785 transitions. [2022-01-19 10:25:40,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:40,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 183 states and 18785 transitions. [2022-01-19 10:25:40,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 184 states, 183 states have (on average 102.65027322404372) internal successors, (18785), 183 states have internal predecessors, (18785), 0 states have call successors, (0), 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 10:25:40,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 184 states, 184 states have (on average 176.0) internal successors, (32384), 184 states have internal predecessors, (32384), 0 states have call successors, (0), 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 10:25:40,908 INFO L81 ComplementDD]: Finished complementDD. Result has 184 states, 184 states have (on average 176.0) internal successors, (32384), 184 states have internal predecessors, (32384), 0 states have call successors, (0), 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 10:25:40,908 INFO L186 Difference]: Start difference. First operand has 968 places, 1841 transitions, 17628 flow. Second operand 183 states and 18785 transitions. [2022-01-19 10:25:40,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1150 places, 6114 transitions, 68168 flow [2022-01-19 10:25:44,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1140 places, 6114 transitions, 66586 flow, removed 310 selfloop flow, removed 10 redundant places. [2022-01-19 10:25:44,909 INFO L242 Difference]: Finished difference. Result has 1251 places, 3389 transitions, 39867 flow [2022-01-19 10:25:44,911 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=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=183, PETRI_FLOW=39867, PETRI_PLACES=1251, PETRI_TRANSITIONS=3389} [2022-01-19 10:25:44,911 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 1090 predicate places. [2022-01-19 10:25:44,911 INFO L470 AbstractCegarLoop]: Abstraction has has 1251 places, 3389 transitions, 39867 flow [2022-01-19 10:25:44,912 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 10:25:44,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:44,912 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 10:25:44,928 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 10:25:45,113 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 10:25:45,113 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 10:25:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash 127973202, now seen corresponding path program 2 times [2022-01-19 10:25:45,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:45,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251727534] [2022-01-19 10:25:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:45,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:45,859 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 10:25:45,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251727534] [2022-01-19 10:25:45,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251727534] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:25:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876233238] [2022-01-19 10:25:45,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:25:45,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:25:45,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:25:45,860 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 10:25:45,861 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 10:25:45,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 10:25:45,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:25:45,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-19 10:25:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:25:46,552 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 10:25:47,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 10:25:47,326 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 10:25:48,565 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 10:25:48,741 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 10:25:48,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:25:51,546 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 10:26:24,358 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 10:26:24,949 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 10:26:24,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876233238] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:26:24,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:26:24,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 29] total 86 [2022-01-19 10:26:24,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738788894] [2022-01-19 10:26:24,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:26:24,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-19 10:26:24,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:26:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-19 10:26:24,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=6829, Unknown=15, NotChecked=166, Total=7310 [2022-01-19 10:26:24,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 176 [2022-01-19 10:26:24,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1251 places, 3389 transitions, 39867 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 10:26:24,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:26:24,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 176 [2022-01-19 10:26:24,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:26:33,545 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 10:26:36,953 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 10:26:55,128 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|) (< (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 10:27:00,061 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|) (< (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 10:27:02,646 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 10:27:32,557 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse1 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse8 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse6 (select .cse8 (+ .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.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))) (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)) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse5 4) (<= 0 .cse6) (= |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) .cse7) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< (div .cse6 (- 4294967296)) (+ (div (+ (* (- 1) .cse6) 4) 4294967296) 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) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse5) (< |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)) (< .cse6 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))))) is different from false [2022-01-19 10:27:34,581 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 10:27:38,229 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 [2022-01-19 10:28:00,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse5 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| 5))) (let ((.cse2 (select .cse6 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse3 (select .cse6 (+ .cse5 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse4 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5)))) (and (<= 0 .cse0) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) .cse1 (<= 0 .cse2) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse2 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) .cse4) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 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) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |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)) (< .cse3 4294967296) (or (and .cse1 (= |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)) (< (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 10:28:44,526 WARN L228 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 66 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:29:26,061 WARN L228 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 70 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-01-19 10:29:53,611 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 10:29:53,611 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 10:29:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 329 states. [2022-01-19 10:29:54,497 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 10:29:54,513 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 10:29:54,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-01-19 10:29:54,697 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 10:29:54,697 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 396 known predicates. [2022-01-19 10:29:54,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-01-19 10:29:54,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 10:29:54,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-19 10:29:54,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-19 10:29:54,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 10:29:54,701 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 10:29:54,703 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 10:29:54,703 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 10:29:54,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 10:29:54 BasicIcfg [2022-01-19 10:29:54,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 10:29:54,705 INFO L158 Benchmark]: Toolchain (without parser) took 820252.30ms. Allocated memory was 408.9MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 352.8MB in the beginning and 7.5GB in the end (delta: -7.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2022-01-19 10:29:54,705 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 408.9MB. Free memory was 371.0MB in the beginning and 370.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:29:54,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.43ms. Allocated memory is still 408.9MB. Free memory was 352.5MB in the beginning and 361.1MB in the end (delta: -8.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. [2022-01-19 10:29:54,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.56ms. Allocated memory is still 408.9MB. Free memory was 361.1MB in the beginning and 359.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:29:54,706 INFO L158 Benchmark]: Boogie Preprocessor took 26.36ms. Allocated memory is still 408.9MB. Free memory was 359.0MB in the beginning and 356.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:29:54,706 INFO L158 Benchmark]: RCFGBuilder took 434.91ms. Allocated memory is still 408.9MB. Free memory was 356.9MB in the beginning and 339.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 10:29:54,706 INFO L158 Benchmark]: TraceAbstraction took 819275.69ms. Allocated memory was 408.9MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 339.1MB in the beginning and 7.5GB in the end (delta: -7.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2022-01-19 10:29:54,707 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 408.9MB. Free memory was 371.0MB in the beginning and 370.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 465.43ms. Allocated memory is still 408.9MB. Free memory was 352.5MB in the beginning and 361.1MB in the end (delta: -8.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.56ms. Allocated memory is still 408.9MB. Free memory was 361.1MB in the beginning and 359.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.36ms. Allocated memory is still 408.9MB. Free memory was 359.0MB in the beginning and 356.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 434.91ms. Allocated memory is still 408.9MB. Free memory was 356.9MB in the beginning and 339.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 819275.69ms. Allocated memory was 408.9MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 339.1MB in the beginning and 7.5GB in the end (delta: -7.1GB). Peak memory consumption was 1.5GB. 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 396 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 396 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 396 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 396 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: 819.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 734.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13760 SdHoareTripleChecker+Valid, 27.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13760 mSDsluCounter, 19235 SdHoareTripleChecker+Invalid, 23.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9493 IncrementalHoareTripleChecker+Unchecked, 26325 mSDsCounter, 912 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48196 IncrementalHoareTripleChecker+Invalid, 58601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 912 mSolverCounterUnsat, 763 mSDtfsCounter, 48196 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3599 GetRequests, 1978 SyntacticMatches, 83 SemanticMatches, 1537 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 216563 ImplicationChecksByTransitivity, 653.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39867occurred in iteration=12, InterpolantAutomatonStates: 899, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 82.0s 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