/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:10:05,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:10:05,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:10:05,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:10:05,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:10:05,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:10:05,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:10:05,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:10:05,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:10:05,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:10:05,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:10:05,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:10:05,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:10:05,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:10:05,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:10:05,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:10:05,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:10:05,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:10:05,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:10:05,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:10:05,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:10:05,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:10:05,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:10:05,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:10:05,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:10:05,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:10:05,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:10:05,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:10:05,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:10:05,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:10:05,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:10:05,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:10:05,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:10:05,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:10:05,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:10:05,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:10:05,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:10:05,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:10:05,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:10:05,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:10:05,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:10:05,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:10:05,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:10:05,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:10:05,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:10:05,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:10:05,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:10:05,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:10:05,880 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:10:05,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:10:05,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:10:05,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:10:05,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:10:05,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:10:05,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:10:05,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:10:05,883 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:10:05,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:10:05,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:10:05,883 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:10:06,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:10:06,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:10:06,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:10:06,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:10:06,096 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:10:06,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-03-15 19:10:06,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae245a4a/d821a14eb5bf4fa59ee12168a815a213/FLAG26073bae4 [2022-03-15 19:10:06,516 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:10:06,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-03-15 19:10:06,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae245a4a/d821a14eb5bf4fa59ee12168a815a213/FLAG26073bae4 [2022-03-15 19:10:06,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae245a4a/d821a14eb5bf4fa59ee12168a815a213 [2022-03-15 19:10:06,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:10:06,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:10:06,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:10:06,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:10:06,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:10:06,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728ad663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06, skipping insertion in model container [2022-03-15 19:10:06,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:10:06,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:10:06,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-03-15 19:10:06,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:10:06,771 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:10:06,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-03-15 19:10:06,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:10:06,814 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:10:06,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06 WrapperNode [2022-03-15 19:10:06,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:10:06,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:10:06,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:10:06,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:10:06,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,881 INFO L137 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-03-15 19:10:06,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:10:06,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:10:06,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:10:06,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:10:06,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:10:06,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:10:06,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:10:06,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:10:06,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (1/1) ... [2022-03-15 19:10:06,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:10:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:06,983 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-03-15 19:10:07,003 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-03-15 19:10:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:10:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:10:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:10:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:10:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:10:07,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:10:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:10:07,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:10:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:10:07,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:10:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:10:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:10:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:10:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:10:07,021 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:10:07,090 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:10:07,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:10:07,601 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:10:07,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:10:07,779 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-03-15 19:10:07,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:10:07 BoogieIcfgContainer [2022-03-15 19:10:07,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:10:07,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:10:07,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:10:07,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:10:07,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:10:06" (1/3) ... [2022-03-15 19:10:07,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:10:07, skipping insertion in model container [2022-03-15 19:10:07,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:10:06" (2/3) ... [2022-03-15 19:10:07,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:10:07, skipping insertion in model container [2022-03-15 19:10:07,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:10:07" (3/3) ... [2022-03-15 19:10:07,787 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-03-15 19:10:07,791 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:10:07,791 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:10:07,791 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:10:07,791 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:10:07,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,874 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,874 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,874 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,874 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,885 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,895 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,896 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,897 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,897 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,897 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,897 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,904 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,906 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,907 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,909 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,910 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,910 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,910 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,910 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:10:07,915 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:10:07,959 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:10:07,965 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:10:07,965 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:10:07,979 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:10:07,985 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 328 transitions, 688 flow [2022-03-15 19:10:07,987 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 328 transitions, 688 flow [2022-03-15 19:10:07,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 316 places, 328 transitions, 688 flow [2022-03-15 19:10:08,102 INFO L129 PetriNetUnfolder]: 25/324 cut-off events. [2022-03-15 19:10:08,102 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:10:08,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 324 events. 25/324 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 284. Up to 2 conditions per place. [2022-03-15 19:10:08,110 INFO L116 LiptonReduction]: Number of co-enabled transitions 2544 [2022-03-15 19:10:17,748 INFO L131 LiptonReduction]: Checked pairs total: 6304 [2022-03-15 19:10:17,748 INFO L133 LiptonReduction]: Total number of compositions: 336 [2022-03-15 19:10:17,772 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 124 flow [2022-03-15 19:10:17,842 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 646 states, 645 states have (on average 4.113178294573643) internal successors, (2653), 645 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 646 states, 645 states have (on average 4.113178294573643) internal successors, (2653), 645 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:10:17,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:17,868 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:17,868 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -106508165, now seen corresponding path program 1 times [2022-03-15 19:10:17,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:17,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116385820] [2022-03-15 19:10:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:18,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:18,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116385820] [2022-03-15 19:10:18,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116385820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:18,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:18,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:10:18,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466853884] [2022-03-15 19:10:18,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:18,201 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:18,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 212 transitions. [2022-03-15 19:10:18,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:19,301 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:19,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:10:19,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:10:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:19,333 INFO L87 Difference]: Start difference. First operand has 646 states, 645 states have (on average 4.113178294573643) internal successors, (2653), 645 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:19,418 INFO L93 Difference]: Finished difference Result 765 states and 3110 transitions. [2022-03-15 19:10:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:10:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:19,432 INFO L225 Difference]: With dead ends: 765 [2022-03-15 19:10:19,432 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 19:10:19,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 70 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:19,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:19,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 19:10:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 726. [2022-03-15 19:10:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 4.085517241379311) internal successors, (2962), 725 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2962 transitions. [2022-03-15 19:10:19,488 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2962 transitions. Word has length 25 [2022-03-15 19:10:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:19,488 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 2962 transitions. [2022-03-15 19:10:19,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2962 transitions. [2022-03-15 19:10:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:10:19,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:19,501 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:19,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:10:19,501 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1782338430, now seen corresponding path program 1 times [2022-03-15 19:10:19,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:19,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680064370] [2022-03-15 19:10:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:19,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:19,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680064370] [2022-03-15 19:10:19,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680064370] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:19,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:19,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:10:19,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980332011] [2022-03-15 19:10:19,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:19,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:19,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 384 transitions. [2022-03-15 19:10:19,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:22,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:22,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:22,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:22,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:22,120 INFO L87 Difference]: Start difference. First operand 726 states and 2962 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:22,225 INFO L93 Difference]: Finished difference Result 899 states and 3416 transitions. [2022-03-15 19:10:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:10:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:10:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:22,229 INFO L225 Difference]: With dead ends: 899 [2022-03-15 19:10:22,229 INFO L226 Difference]: Without dead ends: 727 [2022-03-15 19:10:22,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:22,231 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:22,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-03-15 19:10:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-03-15 19:10:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 4.081267217630854) internal successors, (2963), 726 states have internal predecessors, (2963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2963 transitions. [2022-03-15 19:10:22,255 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2963 transitions. Word has length 27 [2022-03-15 19:10:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:22,255 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 2963 transitions. [2022-03-15 19:10:22,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2963 transitions. [2022-03-15 19:10:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:10:22,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:22,258 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:22,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:10:22,258 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2117051448, now seen corresponding path program 1 times [2022-03-15 19:10:22,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:22,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484425667] [2022-03-15 19:10:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:22,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:22,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484425667] [2022-03-15 19:10:22,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484425667] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:22,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:22,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:10:22,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476033195] [2022-03-15 19:10:22,442 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:22,446 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:22,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 385 transitions. [2022-03-15 19:10:22,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:25,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6191#(or (<= ~client_back~0 ~client_front~0) (< ~client_front~0 0))] [2022-03-15 19:10:25,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:25,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:25,952 INFO L87 Difference]: Start difference. First operand 727 states and 2963 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:26,045 INFO L93 Difference]: Finished difference Result 1363 states and 5446 transitions. [2022-03-15 19:10:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:10:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:26,052 INFO L225 Difference]: With dead ends: 1363 [2022-03-15 19:10:26,053 INFO L226 Difference]: Without dead ends: 1309 [2022-03-15 19:10:26,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 14 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:26,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:26,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-03-15 19:10:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1155. [2022-03-15 19:10:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 4.0823223570190645) internal successors, (4711), 1154 states have internal predecessors, (4711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 4711 transitions. [2022-03-15 19:10:26,089 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 4711 transitions. Word has length 28 [2022-03-15 19:10:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:26,090 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 4711 transitions. [2022-03-15 19:10:26,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 4711 transitions. [2022-03-15 19:10:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:10:26,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:26,094 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:26,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:10:26,094 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash -291413595, now seen corresponding path program 1 times [2022-03-15 19:10:26,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:26,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673224929] [2022-03-15 19:10:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:26,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:26,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673224929] [2022-03-15 19:10:26,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673224929] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:26,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:26,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:10:26,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469341273] [2022-03-15 19:10:26,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:26,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:26,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 389 transitions. [2022-03-15 19:10:26,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:29,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:29,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:10:29,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:10:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:29,174 INFO L87 Difference]: Start difference. First operand 1155 states and 4711 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:29,250 INFO L93 Difference]: Finished difference Result 1149 states and 4470 transitions. [2022-03-15 19:10:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:29,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:10:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:29,257 INFO L225 Difference]: With dead ends: 1149 [2022-03-15 19:10:29,257 INFO L226 Difference]: Without dead ends: 1133 [2022-03-15 19:10:29,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:29,257 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:29,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-03-15 19:10:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1097. [2022-03-15 19:10:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1096 states have (on average 3.9708029197080292) internal successors, (4352), 1096 states have internal predecessors, (4352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 4352 transitions. [2022-03-15 19:10:29,308 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 4352 transitions. Word has length 28 [2022-03-15 19:10:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:29,308 INFO L470 AbstractCegarLoop]: Abstraction has 1097 states and 4352 transitions. [2022-03-15 19:10:29,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 4352 transitions. [2022-03-15 19:10:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:10:29,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:29,311 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:29,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:10:29,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash -43419539, now seen corresponding path program 1 times [2022-03-15 19:10:29,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:29,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594021741] [2022-03-15 19:10:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:29,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:29,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594021741] [2022-03-15 19:10:29,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594021741] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:29,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:29,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:10:29,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658865482] [2022-03-15 19:10:29,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:29,428 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:29,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 234 transitions. [2022-03-15 19:10:29,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:30,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13214#(or (< ~node1_front~0 0) (<= ~node1_back~0 ~node1_front~0))] [2022-03-15 19:10:30,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:30,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:30,374 INFO L87 Difference]: Start difference. First operand 1097 states and 4352 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:30,444 INFO L93 Difference]: Finished difference Result 983 states and 3885 transitions. [2022-03-15 19:10:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:10:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:30,450 INFO L225 Difference]: With dead ends: 983 [2022-03-15 19:10:30,450 INFO L226 Difference]: Without dead ends: 959 [2022-03-15 19:10:30,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:30,451 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:30,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-15 19:10:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2022-03-15 19:10:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 4.00418410041841) internal successors, (3828), 956 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 3828 transitions. [2022-03-15 19:10:30,474 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 3828 transitions. Word has length 28 [2022-03-15 19:10:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:30,474 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 3828 transitions. [2022-03-15 19:10:30,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 3828 transitions. [2022-03-15 19:10:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:10:30,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:30,477 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:30,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:10:30,477 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1519618106, now seen corresponding path program 1 times [2022-03-15 19:10:30,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:30,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954759259] [2022-03-15 19:10:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:30,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:30,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954759259] [2022-03-15 19:10:30,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954759259] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:30,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:30,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:10:30,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275760361] [2022-03-15 19:10:30,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:30,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:30,564 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 219 transitions. [2022-03-15 19:10:30,564 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:31,158 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:31,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:31,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:31,159 INFO L87 Difference]: Start difference. First operand 957 states and 3828 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:31,250 INFO L93 Difference]: Finished difference Result 1115 states and 4218 transitions. [2022-03-15 19:10:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:10:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:10:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:31,255 INFO L225 Difference]: With dead ends: 1115 [2022-03-15 19:10:31,255 INFO L226 Difference]: Without dead ends: 959 [2022-03-15 19:10:31,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:10:31,272 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:31,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-15 19:10:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-03-15 19:10:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 4.001044932079415) internal successors, (3829), 957 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 3829 transitions. [2022-03-15 19:10:31,297 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 3829 transitions. Word has length 32 [2022-03-15 19:10:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:31,299 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 3829 transitions. [2022-03-15 19:10:31,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 3829 transitions. [2022-03-15 19:10:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:10:31,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:31,302 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:31,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:10:31,302 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1306080892, now seen corresponding path program 1 times [2022-03-15 19:10:31,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:31,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259313845] [2022-03-15 19:10:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:31,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:31,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259313845] [2022-03-15 19:10:31,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259313845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:31,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:31,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:10:31,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318358595] [2022-03-15 19:10:31,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:31,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:31,397 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 220 transitions. [2022-03-15 19:10:31,397 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:31,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:31,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:31,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:31,997 INFO L87 Difference]: Start difference. First operand 958 states and 3829 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:32,082 INFO L93 Difference]: Finished difference Result 1093 states and 4202 transitions. [2022-03-15 19:10:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:10:32,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:10:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:32,087 INFO L225 Difference]: With dead ends: 1093 [2022-03-15 19:10:32,087 INFO L226 Difference]: Without dead ends: 960 [2022-03-15 19:10:32,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:10:32,091 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:32,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-03-15 19:10:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 959. [2022-03-15 19:10:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 3.997912317327766) internal successors, (3830), 958 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 3830 transitions. [2022-03-15 19:10:32,115 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 3830 transitions. Word has length 33 [2022-03-15 19:10:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:32,115 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 3830 transitions. [2022-03-15 19:10:32,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 3830 transitions. [2022-03-15 19:10:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:10:32,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:32,118 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:32,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:10:32,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1401833358, now seen corresponding path program 1 times [2022-03-15 19:10:32,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:32,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804276734] [2022-03-15 19:10:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:32,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:32,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804276734] [2022-03-15 19:10:32,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804276734] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:32,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:32,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:10:32,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597100724] [2022-03-15 19:10:32,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:32,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:32,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 221 transitions. [2022-03-15 19:10:32,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:32,833 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:32,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:10:32,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:10:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:10:32,834 INFO L87 Difference]: Start difference. First operand 959 states and 3830 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:32,920 INFO L93 Difference]: Finished difference Result 1337 states and 5140 transitions. [2022-03-15 19:10:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:10:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:10:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:32,925 INFO L225 Difference]: With dead ends: 1337 [2022-03-15 19:10:32,925 INFO L226 Difference]: Without dead ends: 960 [2022-03-15 19:10:32,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:10:32,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:32,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-03-15 19:10:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2022-03-15 19:10:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 3.994786235662148) internal successors, (3831), 959 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 3831 transitions. [2022-03-15 19:10:32,947 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 3831 transitions. Word has length 34 [2022-03-15 19:10:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:32,947 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 3831 transitions. [2022-03-15 19:10:32,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 3831 transitions. [2022-03-15 19:10:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:10:32,949 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:32,949 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:32,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 19:10:32,949 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash -912621320, now seen corresponding path program 1 times [2022-03-15 19:10:32,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:32,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200575339] [2022-03-15 19:10:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:33,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:33,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200575339] [2022-03-15 19:10:33,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200575339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:33,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:33,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:10:33,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1401898867] [2022-03-15 19:10:33,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:33,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:33,142 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 222 transitions. [2022-03-15 19:10:33,142 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:33,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:10:33,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:10:33,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:10:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:33,649 INFO L87 Difference]: Start difference. First operand 960 states and 3831 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:33,706 INFO L93 Difference]: Finished difference Result 580 states and 2328 transitions. [2022-03-15 19:10:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:10:33,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:10:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:33,710 INFO L225 Difference]: With dead ends: 580 [2022-03-15 19:10:33,710 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:10:33,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:10:33,710 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:33,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:10:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2022-03-15 19:10:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 4.042031523642732) internal successors, (2308), 571 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 2308 transitions. [2022-03-15 19:10:33,725 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 2308 transitions. Word has length 35 [2022-03-15 19:10:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:33,725 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 2308 transitions. [2022-03-15 19:10:33,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 2308 transitions. [2022-03-15 19:10:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:10:33,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:33,727 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:10:33,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:10:33,727 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash -624671609, now seen corresponding path program 1 times [2022-03-15 19:10:33,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:33,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832219727] [2022-03-15 19:10:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:33,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:33,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832219727] [2022-03-15 19:10:33,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832219727] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:33,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88751749] [2022-03-15 19:10:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:33,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:33,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:33,902 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-03-15 19:10:33,903 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-03-15 19:10:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:34,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:10:34,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:34,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:10:34,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88751749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:34,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:10:34,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-03-15 19:10:34,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375476299] [2022-03-15 19:10:34,125 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:34,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:34,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 404 transitions. [2022-03-15 19:10:34,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:37,678 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [27278#(or (< ~manager_front~0 0) (<= ~manager_back~0 (+ ~manager_front~0 1))), 27277#(or (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)), 27279#(or (<= ~manager_back~0 (+ 2 ~manager_front~0)) (< ~manager_front~0 0))] [2022-03-15 19:10:37,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:10:37,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:10:37,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:10:37,693 INFO L87 Difference]: Start difference. First operand 572 states and 2308 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:37,804 INFO L93 Difference]: Finished difference Result 2144 states and 8740 transitions. [2022-03-15 19:10:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:10:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 19:10:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:37,816 INFO L225 Difference]: With dead ends: 2144 [2022-03-15 19:10:37,816 INFO L226 Difference]: Without dead ends: 2112 [2022-03-15 19:10:37,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:10:37,817 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:37,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-03-15 19:10:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1700. [2022-03-15 19:10:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 4.228958210712183) internal successors, (7185), 1699 states have internal predecessors, (7185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 7185 transitions. [2022-03-15 19:10:37,906 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 7185 transitions. Word has length 37 [2022-03-15 19:10:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:37,906 INFO L470 AbstractCegarLoop]: Abstraction has 1700 states and 7185 transitions. [2022-03-15 19:10:37,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 7185 transitions. [2022-03-15 19:10:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 19:10:37,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:37,919 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 19:10:37,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:10:38,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:10:38,159 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -272603583, now seen corresponding path program 1 times [2022-03-15 19:10:38,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:38,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427432005] [2022-03-15 19:10:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:38,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:38,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427432005] [2022-03-15 19:10:38,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427432005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:38,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104436066] [2022-03-15 19:10:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:38,285 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-03-15 19:10:38,308 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-03-15 19:10:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:38,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:10:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:38,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:38,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104436066] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:38,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:38,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:10:38,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248846143] [2022-03-15 19:10:38,662 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:38,672 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:38,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 164 states and 366 transitions. [2022-03-15 19:10:38,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:41,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [33076#(or (<= ~manager_size~0 1) (<= ~manager_back~0 0)), 33077#(or (<= ~manager_size~0 ~manager_back~0) (< ~manager_back~0 0) (<= ~manager_size~0 1))] [2022-03-15 19:10:41,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:10:41,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:10:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:10:41,050 INFO L87 Difference]: Start difference. First operand 1700 states and 7185 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:41,215 INFO L93 Difference]: Finished difference Result 1764 states and 7307 transitions. [2022-03-15 19:10:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:10:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 19:10:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:41,247 INFO L225 Difference]: With dead ends: 1764 [2022-03-15 19:10:41,247 INFO L226 Difference]: Without dead ends: 1701 [2022-03-15 19:10:41,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:10:41,248 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:41,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2022-03-15 19:10:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1701. [2022-03-15 19:10:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 4.227058823529412) internal successors, (7186), 1700 states have internal predecessors, (7186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 7186 transitions. [2022-03-15 19:10:41,311 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 7186 transitions. Word has length 41 [2022-03-15 19:10:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:41,311 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 7186 transitions. [2022-03-15 19:10:41,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 7186 transitions. [2022-03-15 19:10:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 19:10:41,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:41,315 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 19:10:41,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:10:41,547 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,SelfDestructingSolverStorable10 [2022-03-15 19:10:41,547 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 152249611, now seen corresponding path program 2 times [2022-03-15 19:10:41,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:41,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307844868] [2022-03-15 19:10:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:41,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:41,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:41,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307844868] [2022-03-15 19:10:41,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307844868] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:41,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396487699] [2022-03-15 19:10:41,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:10:41,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:41,655 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-03-15 19:10:41,656 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-03-15 19:10:41,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:10:41,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:41,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:10:41,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:41,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:42,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396487699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:42,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:42,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:10:42,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554367811] [2022-03-15 19:10:42,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:42,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:42,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 165 states and 367 transitions. [2022-03-15 19:10:42,267 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:44,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [38510#(or (<= ~manager_back~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1))), 38511#(or (<= ~manager_size~0 (+ ~manager_back~0 2)) (< ~manager_back~0 0))] [2022-03-15 19:10:44,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:10:44,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:10:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:10:44,342 INFO L87 Difference]: Start difference. First operand 1701 states and 7186 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:44,528 INFO L93 Difference]: Finished difference Result 1807 states and 7421 transitions. [2022-03-15 19:10:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:10:44,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 19:10:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:44,549 INFO L225 Difference]: With dead ends: 1807 [2022-03-15 19:10:44,549 INFO L226 Difference]: Without dead ends: 1702 [2022-03-15 19:10:44,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:10:44,549 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:44,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:10:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-03-15 19:10:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2022-03-15 19:10:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 4.225161669606114) internal successors, (7187), 1701 states have internal predecessors, (7187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 7187 transitions. [2022-03-15 19:10:44,599 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 7187 transitions. Word has length 42 [2022-03-15 19:10:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:44,599 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 7187 transitions. [2022-03-15 19:10:44,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 7187 transitions. [2022-03-15 19:10:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 19:10:44,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:44,604 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:44,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:10:44,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:44,819 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 437796737, now seen corresponding path program 3 times [2022-03-15 19:10:44,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:44,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549776382] [2022-03-15 19:10:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:10:45,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:45,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549776382] [2022-03-15 19:10:45,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549776382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:45,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:45,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:10:45,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786964469] [2022-03-15 19:10:45,002 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:45,020 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:45,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 166 states and 368 transitions. [2022-03-15 19:10:45,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:47,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [43732#(or (< ~node2_back~0 0) (<= ~node2_back~0 ~node2_front~0))] [2022-03-15 19:10:47,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:10:47,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:10:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:10:47,300 INFO L87 Difference]: Start difference. First operand 1702 states and 7187 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:47,406 INFO L93 Difference]: Finished difference Result 4608 states and 19546 transitions. [2022-03-15 19:10:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:10:47,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-03-15 19:10:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:47,422 INFO L225 Difference]: With dead ends: 4608 [2022-03-15 19:10:47,422 INFO L226 Difference]: Without dead ends: 4576 [2022-03-15 19:10:47,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:10:47,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:47,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2022-03-15 19:10:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3608. [2022-03-15 19:10:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3607 states have (on average 4.477405045744386) internal successors, (16150), 3607 states have internal predecessors, (16150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 16150 transitions. [2022-03-15 19:10:47,522 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 16150 transitions. Word has length 43 [2022-03-15 19:10:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:47,522 INFO L470 AbstractCegarLoop]: Abstraction has 3608 states and 16150 transitions. [2022-03-15 19:10:47,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 16150 transitions. [2022-03-15 19:10:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 19:10:47,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:47,529 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:47,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 19:10:47,529 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1620824053, now seen corresponding path program 1 times [2022-03-15 19:10:47,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:47,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564896191] [2022-03-15 19:10:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:10:47,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:47,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564896191] [2022-03-15 19:10:47,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564896191] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:10:47,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:10:47,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:10:47,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517798550] [2022-03-15 19:10:47,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:47,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:47,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 436 transitions. [2022-03-15 19:10:47,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:51,263 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [55561#(or (< ~node1_front~0 0) (<= ~node1_back~0 ~node1_front~0)), 55562#(or (< ~node1_front~0 0) (<= ~node1_back~0 (+ ~node1_front~0 1)))] [2022-03-15 19:10:51,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:10:51,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:10:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:10:51,264 INFO L87 Difference]: Start difference. First operand 3608 states and 16150 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:51,405 INFO L93 Difference]: Finished difference Result 9750 states and 43785 transitions. [2022-03-15 19:10:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:10:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-03-15 19:10:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:51,458 INFO L225 Difference]: With dead ends: 9750 [2022-03-15 19:10:51,458 INFO L226 Difference]: Without dead ends: 9712 [2022-03-15 19:10:51,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:10:51,458 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:51,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9712 states. [2022-03-15 19:10:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9712 to 7594. [2022-03-15 19:10:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7594 states, 7593 states have (on average 4.7364677992888184) internal successors, (35964), 7593 states have internal predecessors, (35964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7594 states to 7594 states and 35964 transitions. [2022-03-15 19:10:51,687 INFO L78 Accepts]: Start accepts. Automaton has 7594 states and 35964 transitions. Word has length 43 [2022-03-15 19:10:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:51,688 INFO L470 AbstractCegarLoop]: Abstraction has 7594 states and 35964 transitions. [2022-03-15 19:10:51,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7594 states and 35964 transitions. [2022-03-15 19:10:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 19:10:51,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:51,691 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 19:10:51,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 19:10:51,691 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 627946921, now seen corresponding path program 1 times [2022-03-15 19:10:51,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:51,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303228262] [2022-03-15 19:10:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:10:51,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:51,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303228262] [2022-03-15 19:10:51,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303228262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:51,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196590848] [2022-03-15 19:10:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:51,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:51,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:51,831 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-03-15 19:10:51,833 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-03-15 19:10:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:51,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:10:51,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:10:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:10:52,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196590848] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:52,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:52,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 19:10:52,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802788773] [2022-03-15 19:10:52,193 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:52,202 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:52,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 345 transitions. [2022-03-15 19:10:52,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:54,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [80666#(or (<= ~client_back~0 0) (<= ~client_size~0 ~client_back~0))] [2022-03-15 19:10:54,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:10:54,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:10:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:10:54,878 INFO L87 Difference]: Start difference. First operand 7594 states and 35964 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:55,057 INFO L93 Difference]: Finished difference Result 7714 states and 36222 transitions. [2022-03-15 19:10:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:10:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-03-15 19:10:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:55,085 INFO L225 Difference]: With dead ends: 7714 [2022-03-15 19:10:55,085 INFO L226 Difference]: Without dead ends: 7595 [2022-03-15 19:10:55,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:10:55,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:55,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7595 states. [2022-03-15 19:10:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7595 to 7595. [2022-03-15 19:10:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7595 states, 7594 states have (on average 4.735975770345009) internal successors, (35965), 7594 states have internal predecessors, (35965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 35965 transitions. [2022-03-15 19:10:55,277 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 35965 transitions. Word has length 43 [2022-03-15 19:10:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:55,277 INFO L470 AbstractCegarLoop]: Abstraction has 7595 states and 35965 transitions. [2022-03-15 19:10:55,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 35965 transitions. [2022-03-15 19:10:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 19:10:55,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:55,280 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:10:55,299 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-03-15 19:10:55,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:10:55,499 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:10:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 644310655, now seen corresponding path program 2 times [2022-03-15 19:10:55,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:55,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575366913] [2022-03-15 19:10:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:58,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:58,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575366913] [2022-03-15 19:10:58,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575366913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:58,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190351908] [2022-03-15 19:10:58,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:10:58,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:58,384 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-03-15 19:10:58,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:10:58,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:10:58,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:58,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 137 conjunts are in the unsatisfiable core [2022-03-15 19:10:58,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:01,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:06,412 INFO L353 Elim1Store]: treesize reduction 249, result has 80.0 percent of original size [2022-03-15 19:11:06,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 210 treesize of output 1037 [2022-03-15 19:11:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:42,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190351908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:42,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:42,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2022-03-15 19:11:42,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182575300] [2022-03-15 19:11:42,687 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:42,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:42,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 346 transitions. [2022-03-15 19:11:42,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:24,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [104015#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0)) (or (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~client~0.offset 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)) (or (<= ~client_back~0 0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (= (* ~manager_back~0 4) (+ (* ~manager_front~0 4) 4)) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= ~node2~0.offset 0))), 103886#(or (<= ~client_size~0 ~client_back~0) (<= ~client_back~0 ~client_front~0) (< ~client_front~0 0) (and (= ~ok~0 (select (select |#memory_int| ~client~0.base) (+ (* ~client_front~0 4) ~client~0.offset))) (not (= (mod ~safe~0 256) 0)))), 104013#(and (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (= ~node2~0.offset 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (<= ~node1_back~0 ~node1_front~0))), 104009#(and (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0)) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~client_size~0 2) (< ~manager_front~0 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (< ~manager_front~0 0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (< ~manager_front~0 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) ~manager~0.offset 4))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (< ~manager_front~0 0) (= ~node2~0.offset 0))), 104016#(and (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (= ~client~0.offset 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (= (+ (* ~manager_front~0 4) 4) (+ (* ~manager_back~0 4) 4)) (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (= (+ (* ~client_front~0 4) ~client~0.offset) 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= ~node2~0.offset 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (< ~node2_back~0 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~manager_size~0 (+ ~manager_back~0 1)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset (* ~manager_back~0 4) 11)) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4) 4)) ~ok~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~update~0)))), 104011#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4)) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (<= ~client_back~0 0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0) (= ~node2~0.offset 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (< ~node2_back~0 0) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~ok~0)) (or (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (< ~node2_back~0 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (<= ~node2_size~0 ~node2_back~0))), 104012#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0) (= ~node2~0.offset 0)) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~node2_size~0 ~node2_back~0))), 104008#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (= ~client~0.offset 0) (not (= ~client_back~0 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= ~client_back~0 0) (<= ~manager_size~0 ~manager_front~0) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (not (= (mod ~safe~0 256) 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4)) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~manager_back~0 ~manager_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~ok~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 3 (* ~manager_back~0 4))) (not (= ~client_back~0 0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0)) (or (<= ~manager_size~0 ~manager_front~0) (< ~manager_front~0 0) (<= ~manager_back~0 ~manager_front~0) (= ~node2~0.offset 0))), 104017#(and (or (<= ~client_back~0 0) (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~client_size~0 2) (not (<= 0 ~manager_back~0))) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (<= 0 ~manager_back~0)) (= ~node2~0.offset 0)) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (not (<= 0 ~manager_back~0))) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (<= 0 ~manager_back~0)) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (<= 0 ~manager_back~0)) (<= 1 ~safe~0)) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (div ~safe~0 256) 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (<= 0 ~manager_back~0))) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (not (<= 0 ~manager_back~0)) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (* ~manager_size~0 4) (+ (* ~manager_back~0 4) 8)) (not (= ~client_back~0 0)) (< ~manager_back~0 0)) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (not (<= 0 ~manager_back~0))) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~manager~0.offset 0) (not (<= 0 ~manager_back~0))) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (not (= ~client_back~0 0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (not (<= 0 ~manager_back~0)))), 104010#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (< ~manager_front~0 0) (= ~node2~0.offset 0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0))), 104018#(and (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (<= (* ~manager_size~0 4) (+ (* ~manager_back~0 4) 8)) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_back~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (= ~client~0.offset 0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (<= 0 ~manager_back~0)) (<= ~node1_back~0 ~node1_front~0)) (or (<= ~client_back~0 0) (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (<= ~client_size~0 2) (not (<= 0 ~manager_back~0)) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (= (+ (* ~client_front~0 4) ~client~0.offset) 0) (<= ~node1_back~0 ~node1_front~0)) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (= ~manager~0.offset 0) (not (<= 0 ~manager_back~0)) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (not (< ~manager_back~0 ~manager_size~0)) (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (+ ~manager~0.offset (* ~manager_back~0 4))) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (< ~manager_front~0 0) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0) (<= ~node1_back~0 ~node1_front~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~node1_back~0 ~node1_front~0)) (or (not (< ~manager_back~0 ~manager_size~0)) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= ~node1_size~0 ~node1_front~0) (< ~node1_front~0 0) (not (<= 0 ~manager_back~0)) (= ~node2~0.offset 0) (<= ~node1_back~0 ~node1_front~0))), 104014#(and (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (= ~manager~0.offset 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (= ~client~0.offset 0) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= (+ (* ~client_front~0 4) ~client~0.offset) 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_front~0 4))) ~update~0) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= ~client_back~0 0) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (<= ~client_size~0 2) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (= (+ ~node2~0.offset (* ~node2_front~0 4)) 0) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= ~node2~0.offset 0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (= (+ ~manager~0.offset (* ~manager_back~0 4) 4) (+ (* ~manager_front~0 4) ~manager~0.offset 4)) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset)))) (= (select (select |#memory_int| ~node1~0.base) (+ ~node1~0.offset (* ~node1_front~0 4))) ~update~0)) (or (<= (* ~manager_size~0 4) (+ ~manager~0.offset 7 (* ~manager_back~0 4))) (<= (+ ~manager_back~0 1) ~manager_front~0) (<= ~manager_size~0 ~manager_back~0) (< ~node2_back~0 0) (not (= (select (select |#memory_int| ~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) ~ok~0)) (<= (+ ~node1_back~0 1) ~node1_front~0) (not (= ~client_back~0 0)) (< ~node1_front~0 0) (not (= (select (select |#memory_int| ~node2~0.base) (+ ~node2~0.offset (* ~node2_back~0 4))) ~update~0)) (not (= (mod ~safe~0 256) 0)) (< ~manager_front~0 0) (<= ~node1_size~0 ~node1_back~0) (<= ~node2_size~0 ~node2_back~0) (not (= ~update~0 (select (select |#memory_int| ~node1~0.base) (+ (* 4 ~node1_back~0) ~node1~0.offset))))))] [2022-03-15 19:12:24,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:12:24,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:12:24,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=6258, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:12:24,992 INFO L87 Difference]: Start difference. First operand 7595 states and 35965 transitions. Second operand has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:24,474 INFO L93 Difference]: Finished difference Result 203441 states and 963362 transitions. [2022-03-15 19:13:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-03-15 19:13:24,475 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 19:13:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:26,494 INFO L225 Difference]: With dead ends: 203441 [2022-03-15 19:13:26,494 INFO L226 Difference]: Without dead ends: 202526 [2022-03-15 19:13:26,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 92 SyntacticMatches, 47 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25117 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=9041, Invalid=56751, Unknown=0, NotChecked=0, Total=65792 [2022-03-15 19:13:26,504 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1064 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 8546 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 8546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:26,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1064 Valid, 0 Invalid, 9683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 8546 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-03-15 19:13:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202526 states. [2022-03-15 19:13:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202526 to 63666. [2022-03-15 19:13:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63666 states, 63665 states have (on average 5.416853844341475) internal successors, (344864), 63665 states have internal predecessors, (344864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63666 states to 63666 states and 344864 transitions. [2022-03-15 19:13:32,230 INFO L78 Accepts]: Start accepts. Automaton has 63666 states and 344864 transitions. Word has length 44 [2022-03-15 19:13:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:32,230 INFO L470 AbstractCegarLoop]: Abstraction has 63666 states and 344864 transitions. [2022-03-15 19:13:32,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 63666 states and 344864 transitions. [2022-03-15 19:13:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 19:13:32,237 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:32,241 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:13:32,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:13:32,455 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,SelfDestructingSolverStorable15 [2022-03-15 19:13:32,455 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:13:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1620800451, now seen corresponding path program 3 times [2022-03-15 19:13:32,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:32,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477711130] [2022-03-15 19:13:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:35,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:35,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477711130] [2022-03-15 19:13:35,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477711130] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:35,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950187792] [2022-03-15 19:13:35,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:13:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:35,285 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-03-15 19:13:35,287 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-03-15 19:13:35,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:13:35,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:35,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 143 conjunts are in the unsatisfiable core [2022-03-15 19:13:35,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:36,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:13:36,214 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 15 treesize of output 11 [2022-03-15 19:13:36,342 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:13:36,342 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-03-15 19:13:36,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:13:36,559 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 6 treesize of output 5 [2022-03-15 19:13:36,685 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 6 treesize of output 5 [2022-03-15 19:13:36,818 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 6 treesize of output 5 [2022-03-15 19:13:36,916 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 6 treesize of output 5 [2022-03-15 19:13:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:38,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:30,044 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:14:30,044 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 663 treesize of output 459 [2022-03-15 19:14:44,656 WARN L228 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 275 DAG size of output: 251 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-03-15 19:14:44,657 INFO L353 Elim1Store]: treesize reduction 138, result has 86.1 percent of original size [2022-03-15 19:14:44,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 2040296110 treesize of output 2002086278 Received shutdown request... [2022-03-15 19:24:18,088 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-03-15 19:24:18,090 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-03-15 19:24:18,138 WARN L244 SmtUtils]: Removed 1 from assertion stack [2022-03-15 19:24:18,141 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 19:24:18,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 19:24:18,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:24:18,359 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-03-15 19:24:18,361 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 19:24:18,361 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 19:24:18,361 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 19:24:18,361 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 19:24:18,363 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:18,365 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:24:18,365 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:24:18,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:24:18 BasicIcfg [2022-03-15 19:24:18,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:24:18,367 INFO L158 Benchmark]: Toolchain (without parser) took 851830.46ms. Allocated memory was 190.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 138.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-03-15 19:24:18,367 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 155.4MB in the beginning and 155.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:24:18,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.24ms. Allocated memory is still 190.8MB. Free memory was 138.7MB in the beginning and 162.8MB in the end (delta: -24.1MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-03-15 19:24:18,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.78ms. Allocated memory is still 190.8MB. Free memory was 162.8MB in the beginning and 159.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 19:24:18,368 INFO L158 Benchmark]: Boogie Preprocessor took 59.08ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 157.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:24:18,368 INFO L158 Benchmark]: RCFGBuilder took 840.99ms. Allocated memory is still 190.8MB. Free memory was 157.0MB in the beginning and 98.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-03-15 19:24:18,370 INFO L158 Benchmark]: TraceAbstraction took 850583.38ms. Allocated memory was 190.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 97.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-03-15 19:24:18,374 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 155.4MB in the beginning and 155.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.24ms. Allocated memory is still 190.8MB. Free memory was 138.7MB in the beginning and 162.8MB in the end (delta: -24.1MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.78ms. Allocated memory is still 190.8MB. Free memory was 162.8MB in the beginning and 159.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.08ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 157.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 840.99ms. Allocated memory is still 190.8MB. Free memory was 157.0MB in the beginning and 98.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * TraceAbstraction took 850583.38ms. Allocated memory was 190.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 97.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 316 PlacesBefore, 51 PlacesAfterwards, 328 TransitionsBefore, 46 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 8 FixpointIterations, 233 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 11 ConcurrentYvCompositions, 17 ChoiceCompositions, 336 TotalNumberOfCompositions, 6304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3336, positive: 3154, positive conditional: 0, positive unconditional: 3154, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1440, positive: 1411, positive conditional: 0, positive unconditional: 1411, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3336, positive: 1743, positive conditional: 0, positive unconditional: 1743, negative: 153, negative conditional: 0, negative unconditional: 153, unknown: 1440, unknown conditional: 0, unknown unconditional: 1440] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - 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: 186]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-60-6-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-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 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 344 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 850.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 63.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1764 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1764 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3990 mSDsCounter, 1242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10512 IncrementalHoareTripleChecker+Invalid, 11754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1242 mSolverCounterUnsat, 0 mSDtfsCounter, 10512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2318 GetRequests, 1814 SyntacticMatches, 166 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25515 ImplicationChecksByTransitivity, 56.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63666occurred in iteration=16, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 142582 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 48.1s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 915 ConstructedInterpolants, 20 QuantifiedInterpolants, 9505 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2794 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 146/213 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