/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/barrier_2t.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 23:12:45,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 23:12:45,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 23:12:45,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 23:12:45,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 23:12:45,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 23:12:45,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 23:12:45,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 23:12:45,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 23:12:45,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 23:12:45,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 23:12:45,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 23:12:45,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 23:12:45,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 23:12:45,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 23:12:45,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 23:12:45,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 23:12:45,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 23:12:45,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 23:12:45,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 23:12:45,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 23:12:45,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 23:12:45,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 23:12:45,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 23:12:45,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 23:12:45,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 23:12:45,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 23:12:45,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 23:12:45,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 23:12:45,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 23:12:45,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 23:12:45,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 23:12:45,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 23:12:45,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 23:12:45,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 23:12:45,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 23:12:45,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 23:12:45,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 23:12:45,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 23:12:45,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 23:12:45,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 23:12:45,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 23:12:45,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 23:12:45,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 23:12:45,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 23:12:46,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 23:12:46,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 23:12:46,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 23:12:46,000 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 23:12:46,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 23:12:46,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 23:12:46,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 23:12:46,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 23:12:46,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 23:12:46,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 23:12:46,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 23:12:46,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 23:12:46,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 23:12:46,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 23:12:46,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 23:12:46,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 23:12:46,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 23:12:46,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 23:12:46,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 23:12:46,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 23:12:46,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 23:12:46,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 23:12:46,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 23:12:46,267 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 23:12:46,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/barrier_2t.i [2022-01-18 23:12:46,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73440511/7aea1edf6fcc4404ae8790f3584ff2d0/FLAG360cb7f6a [2022-01-18 23:12:46,833 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 23:12:46,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i [2022-01-18 23:12:46,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73440511/7aea1edf6fcc4404ae8790f3584ff2d0/FLAG360cb7f6a [2022-01-18 23:12:47,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73440511/7aea1edf6fcc4404ae8790f3584ff2d0 [2022-01-18 23:12:47,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 23:12:47,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 23:12:47,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 23:12:47,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 23:12:47,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 23:12:47,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe02b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47, skipping insertion in model container [2022-01-18 23:12:47,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 23:12:47,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 23:12:47,531 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 23:12:47,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[30484,30497] [2022-01-18 23:12:47,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[31858,31871] [2022-01-18 23:12:47,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[31909,31922] [2022-01-18 23:12:47,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32058,32071] [2022-01-18 23:12:47,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32135,32148] [2022-01-18 23:12:47,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32182,32195] [2022-01-18 23:12:47,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32291,32304] [2022-01-18 23:12:47,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32410,32423] [2022-01-18 23:12:47,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32458,32471] [2022-01-18 23:12:47,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32535,32548] [2022-01-18 23:12:47,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32661,32674] [2022-01-18 23:12:47,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[33244,33257] [2022-01-18 23:12:47,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[33321,33334] [2022-01-18 23:12:47,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 23:12:47,769 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 23:12:47,785 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 23:12:47,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[30484,30497] [2022-01-18 23:12:47,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[31858,31871] [2022-01-18 23:12:47,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[31909,31922] [2022-01-18 23:12:47,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32058,32071] [2022-01-18 23:12:47,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32135,32148] [2022-01-18 23:12:47,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32182,32195] [2022-01-18 23:12:47,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32291,32304] [2022-01-18 23:12:47,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32410,32423] [2022-01-18 23:12:47,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32458,32471] [2022-01-18 23:12:47,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32535,32548] [2022-01-18 23:12:47,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[32661,32674] [2022-01-18 23:12:47,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[33244,33257] [2022-01-18 23:12:47,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/barrier_2t.i[33321,33334] [2022-01-18 23:12:47,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 23:12:47,881 INFO L208 MainTranslator]: Completed translation [2022-01-18 23:12:47,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47 WrapperNode [2022-01-18 23:12:47,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 23:12:47,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 23:12:47,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 23:12:47,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 23:12:47,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,948 INFO L137 Inliner]: procedures = 174, calls = 78, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 521 [2022-01-18 23:12:47,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 23:12:47,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 23:12:47,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 23:12:47,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 23:12:47,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:47,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 23:12:47,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 23:12:47,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 23:12:47,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 23:12:47,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (1/1) ... [2022-01-18 23:12:48,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 23:12:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:12:48,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 23:12:48,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-01-18 23:12:48,071 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 23:12:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 23:12:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 23:12:48,073 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 23:12:48,251 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 23:12:48,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 23:12:48,729 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 23:12:48,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 23:12:48,739 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-01-18 23:12:48,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:12:48 BoogieIcfgContainer [2022-01-18 23:12:48,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 23:12:48,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 23:12:48,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 23:12:48,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 23:12:48,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 11:12:47" (1/3) ... [2022-01-18 23:12:48,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbd310e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:12:48, skipping insertion in model container [2022-01-18 23:12:48,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:12:47" (2/3) ... [2022-01-18 23:12:48,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbd310e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:12:48, skipping insertion in model container [2022-01-18 23:12:48,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:12:48" (3/3) ... [2022-01-18 23:12:48,747 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier_2t.i [2022-01-18 23:12:48,751 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 23:12:48,751 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-01-18 23:12:48,751 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 23:12:48,818 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,818 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,818 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,818 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,819 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,820 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,821 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,822 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,823 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,823 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,823 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,823 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,823 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,824 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,825 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,825 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,825 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,825 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,825 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,826 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,826 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,826 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,827 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,828 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,828 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,828 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,828 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,829 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,829 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,830 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,830 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,833 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,839 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,840 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,841 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,842 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,843 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,844 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,845 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,846 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,847 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,848 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,849 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,850 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,851 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,851 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,851 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,853 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,853 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,854 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,855 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,858 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,858 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,858 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,858 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,858 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,859 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,860 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,861 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,862 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,867 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,867 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,868 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,869 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,870 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,871 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,871 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,871 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,871 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,872 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,873 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,874 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,875 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,875 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,875 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,875 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,876 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,877 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,878 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,879 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,880 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,880 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,880 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,880 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,880 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,882 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,883 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,883 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,883 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,883 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,883 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,885 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,885 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,886 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,887 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,888 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,889 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,890 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,891 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,892 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,893 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,894 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,895 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,895 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,895 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,895 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,896 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,896 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,897 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,898 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,901 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,901 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,902 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,902 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,902 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,902 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,902 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,920 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,920 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,920 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,920 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,920 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,921 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,921 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,921 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,921 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,921 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,922 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,923 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,924 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,925 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,926 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,927 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,928 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,929 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,930 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,931 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,932 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,933 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,934 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,935 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,936 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,937 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,938 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,939 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,940 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,940 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,940 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,940 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,940 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,941 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,942 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,943 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,944 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,945 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,946 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,946 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,948 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,948 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,948 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,948 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,949 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,949 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,949 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,949 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,949 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,950 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,951 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,952 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,953 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,954 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,955 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,955 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,955 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,955 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,955 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,958 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,959 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~a~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,960 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~sig~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,961 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~pre22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_~tid~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,962 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_barrier_wait_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,963 WARN L322 ript$VariableManager]: TermVariabe |worker_fnThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:12:48,966 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-18 23:12:49,000 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 23:12:49,005 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 23:12:49,006 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-01-18 23:12:49,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 514 places, 581 transitions, 1170 flow [2022-01-18 23:12:49,266 INFO L129 PetriNetUnfolder]: 106/858 cut-off events. [2022-01-18 23:12:49,267 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-18 23:12:49,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 858 events. 106/858 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3084 event pairs, 0 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 4 conditions per place. [2022-01-18 23:12:49,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 514 places, 581 transitions, 1170 flow [2022-01-18 23:12:49,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 514 places, 581 transitions, 1170 flow [2022-01-18 23:12:49,314 INFO L129 PetriNetUnfolder]: 3/54 cut-off events. [2022-01-18 23:12:49,314 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 23:12:49,314 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:49,315 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:49,315 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1870030157, now seen corresponding path program 1 times [2022-01-18 23:12:49,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761831904] [2022-01-18 23:12:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:49,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 23:12:49,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:49,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761831904] [2022-01-18 23:12:49,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761831904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:49,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:12:49,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 23:12:49,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496142068] [2022-01-18 23:12:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:49,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 23:12:49,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 23:12:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 23:12:49,543 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 581 [2022-01-18 23:12:49,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 581 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 528.0) internal successors, (1584), 3 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:49,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:49,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 581 [2022-01-18 23:12:49,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:49,770 INFO L129 PetriNetUnfolder]: 40/798 cut-off events. [2022-01-18 23:12:49,771 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-18 23:12:49,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 798 events. 40/798 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2922 event pairs, 0 based on Foata normal form. 65/785 useless extension candidates. Maximal degree in co-relation 473. Up to 12 conditions per place. [2022-01-18 23:12:49,789 INFO L132 encePairwiseOnDemand]: 535/581 looper letters, 15 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2022-01-18 23:12:49,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 544 transitions, 1130 flow [2022-01-18 23:12:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 23:12:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 23:12:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1643 transitions. [2022-01-18 23:12:49,808 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.942627653471027 [2022-01-18 23:12:49,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1643 transitions. [2022-01-18 23:12:49,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1643 transitions. [2022-01-18 23:12:49,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:49,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1643 transitions. [2022-01-18 23:12:49,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:49,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:49,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:49,847 INFO L186 Difference]: Start difference. First operand has 514 places, 581 transitions, 1170 flow. Second operand 3 states and 1643 transitions. [2022-01-18 23:12:49,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 544 transitions, 1130 flow [2022-01-18 23:12:49,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 544 transitions, 1130 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-18 23:12:49,866 INFO L242 Difference]: Finished difference. Result has 517 places, 539 transitions, 1096 flow [2022-01-18 23:12:49,869 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=517, PETRI_TRANSITIONS=539} [2022-01-18 23:12:49,872 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 3 predicate places. [2022-01-18 23:12:49,872 INFO L470 AbstractCegarLoop]: Abstraction has has 517 places, 539 transitions, 1096 flow [2022-01-18 23:12:49,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 528.0) internal successors, (1584), 3 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:49,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:49,873 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:49,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 23:12:49,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1201829103, now seen corresponding path program 1 times [2022-01-18 23:12:49,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:49,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539332360] [2022-01-18 23:12:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:49,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 23:12:50,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:50,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539332360] [2022-01-18 23:12:50,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539332360] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:12:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031314148] [2022-01-18 23:12:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:50,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:12:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:12:50,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:12:50,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 23:12:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:50,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-18 23:12:50,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:12:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 23:12:50,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:12:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 23:12:50,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031314148] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:12:50,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:12:50,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-01-18 23:12:50,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836348765] [2022-01-18 23:12:50,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:12:50,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-18 23:12:50,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-18 23:12:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-18 23:12:50,331 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 581 [2022-01-18 23:12:50,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 539 transitions, 1096 flow. Second operand has 5 states, 5 states have (on average 530.2) internal successors, (2651), 5 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:50,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 581 [2022-01-18 23:12:50,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:50,538 INFO L129 PetriNetUnfolder]: 40/800 cut-off events. [2022-01-18 23:12:50,538 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-18 23:12:50,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 800 events. 40/800 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2913 event pairs, 0 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 774. Up to 7 conditions per place. [2022-01-18 23:12:50,550 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 14 selfloop transitions, 4 changer transitions 0/545 dead transitions. [2022-01-18 23:12:50,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 545 transitions, 1144 flow [2022-01-18 23:12:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 23:12:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-18 23:12:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2127 transitions. [2022-01-18 23:12:50,555 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9152323580034424 [2022-01-18 23:12:50,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2127 transitions. [2022-01-18 23:12:50,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2127 transitions. [2022-01-18 23:12:50,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:50,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2127 transitions. [2022-01-18 23:12:50,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 531.75) internal successors, (2127), 4 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,567 INFO L186 Difference]: Start difference. First operand has 517 places, 539 transitions, 1096 flow. Second operand 4 states and 2127 transitions. [2022-01-18 23:12:50,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 545 transitions, 1144 flow [2022-01-18 23:12:50,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 545 transitions, 1142 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 23:12:50,576 INFO L242 Difference]: Finished difference. Result has 521 places, 540 transitions, 1114 flow [2022-01-18 23:12:50,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1114, PETRI_PLACES=521, PETRI_TRANSITIONS=540} [2022-01-18 23:12:50,578 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 7 predicate places. [2022-01-18 23:12:50,578 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 540 transitions, 1114 flow [2022-01-18 23:12:50,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 530.2) internal successors, (2651), 5 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:50,580 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:50,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 23:12:50,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:12:50,795 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -24715469, now seen corresponding path program 2 times [2022-01-18 23:12:50,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496735597] [2022-01-18 23:12:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:50,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:50,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496735597] [2022-01-18 23:12:50,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496735597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:50,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:12:50,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 23:12:50,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635478551] [2022-01-18 23:12:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:50,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 23:12:50,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 23:12:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 23:12:50,909 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 581 [2022-01-18 23:12:50,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 540 transitions, 1114 flow. Second operand has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:50,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:50,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 581 [2022-01-18 23:12:50,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:51,041 INFO L129 PetriNetUnfolder]: 40/798 cut-off events. [2022-01-18 23:12:51,042 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-01-18 23:12:51,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 798 events. 40/798 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2909 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 761. Up to 5 conditions per place. [2022-01-18 23:12:51,055 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/538 dead transitions. [2022-01-18 23:12:51,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 538 transitions, 1124 flow [2022-01-18 23:12:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 23:12:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-18 23:12:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2128 transitions. [2022-01-18 23:12:51,060 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2022-01-18 23:12:51,060 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2128 transitions. [2022-01-18 23:12:51,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2128 transitions. [2022-01-18 23:12:51,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:51,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2128 transitions. [2022-01-18 23:12:51,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 532.0) internal successors, (2128), 4 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,070 INFO L186 Difference]: Start difference. First operand has 521 places, 540 transitions, 1114 flow. Second operand 4 states and 2128 transitions. [2022-01-18 23:12:51,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 538 transitions, 1124 flow [2022-01-18 23:12:51,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 538 transitions, 1120 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-18 23:12:51,081 INFO L242 Difference]: Finished difference. Result has 521 places, 538 transitions, 1110 flow [2022-01-18 23:12:51,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1110, PETRI_PLACES=521, PETRI_TRANSITIONS=538} [2022-01-18 23:12:51,083 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 7 predicate places. [2022-01-18 23:12:51,084 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 538 transitions, 1110 flow [2022-01-18 23:12:51,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,085 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:51,085 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:51,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 23:12:51,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1817996092, now seen corresponding path program 1 times [2022-01-18 23:12:51,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:51,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159089355] [2022-01-18 23:12:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:51,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:51,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:51,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159089355] [2022-01-18 23:12:51,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159089355] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:12:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535350823] [2022-01-18 23:12:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:51,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:12:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:12:51,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:12:51,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 23:12:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:51,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-18 23:12:51,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:12:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:51,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 23:12:51,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535350823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:51,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 23:12:51,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-01-18 23:12:51,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359535112] [2022-01-18 23:12:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:51,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 23:12:51,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 23:12:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 23:12:51,476 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 581 [2022-01-18 23:12:51,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 538 transitions, 1110 flow. Second operand has 4 states, 4 states have (on average 531.25) internal successors, (2125), 4 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:51,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 581 [2022-01-18 23:12:51,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:51,613 INFO L129 PetriNetUnfolder]: 40/793 cut-off events. [2022-01-18 23:12:51,613 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-18 23:12:51,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 793 events. 40/793 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2870 event pairs, 0 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 759. Up to 5 conditions per place. [2022-01-18 23:12:51,628 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 7 selfloop transitions, 3 changer transitions 0/538 dead transitions. [2022-01-18 23:12:51,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 538 transitions, 1128 flow [2022-01-18 23:12:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 23:12:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-18 23:12:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2127 transitions. [2022-01-18 23:12:51,633 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9152323580034424 [2022-01-18 23:12:51,633 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2127 transitions. [2022-01-18 23:12:51,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2127 transitions. [2022-01-18 23:12:51,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:51,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2127 transitions. [2022-01-18 23:12:51,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 531.75) internal successors, (2127), 4 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 581.0) internal successors, (2905), 5 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,643 INFO L186 Difference]: Start difference. First operand has 521 places, 538 transitions, 1110 flow. Second operand 4 states and 2127 transitions. [2022-01-18 23:12:51,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 538 transitions, 1128 flow [2022-01-18 23:12:51,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 538 transitions, 1121 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-18 23:12:51,653 INFO L242 Difference]: Finished difference. Result has 521 places, 538 transitions, 1116 flow [2022-01-18 23:12:51,654 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1116, PETRI_PLACES=521, PETRI_TRANSITIONS=538} [2022-01-18 23:12:51,655 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 7 predicate places. [2022-01-18 23:12:51,655 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 538 transitions, 1116 flow [2022-01-18 23:12:51,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 531.25) internal successors, (2125), 4 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,656 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:51,657 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:51,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 23:12:51,879 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,SelfDestructingSolverStorable3 [2022-01-18 23:12:51,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1614772030, now seen corresponding path program 1 times [2022-01-18 23:12:51,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:51,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567740645] [2022-01-18 23:12:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:51,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:51,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567740645] [2022-01-18 23:12:51,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567740645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:51,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:12:51,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 23:12:51,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922061247] [2022-01-18 23:12:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:51,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 23:12:51,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 23:12:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 23:12:51,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 581 [2022-01-18 23:12:51,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 538 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:51,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:51,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 581 [2022-01-18 23:12:51,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:52,060 INFO L129 PetriNetUnfolder]: 27/573 cut-off events. [2022-01-18 23:12:52,060 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-18 23:12:52,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 573 events. 27/573 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1325 event pairs, 0 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 540. Up to 5 conditions per place. [2022-01-18 23:12:52,073 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 7 selfloop transitions, 2 changer transitions 0/537 dead transitions. [2022-01-18 23:12:52,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 537 transitions, 1128 flow [2022-01-18 23:12:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 23:12:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 23:12:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2022-01-18 23:12:52,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2022-01-18 23:12:52,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2022-01-18 23:12:52,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2022-01-18 23:12:52,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:52,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2022-01-18 23:12:52,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:52,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:52,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:52,085 INFO L186 Difference]: Start difference. First operand has 521 places, 538 transitions, 1116 flow. Second operand 3 states and 1597 transitions. [2022-01-18 23:12:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 537 transitions, 1128 flow [2022-01-18 23:12:52,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 537 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 23:12:52,094 INFO L242 Difference]: Finished difference. Result has 521 places, 537 transitions, 1111 flow [2022-01-18 23:12:52,094 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=521, PETRI_TRANSITIONS=537} [2022-01-18 23:12:52,095 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 7 predicate places. [2022-01-18 23:12:52,095 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 537 transitions, 1111 flow [2022-01-18 23:12:52,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:52,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:52,096 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:52,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 23:12:52,097 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1162500929, now seen corresponding path program 1 times [2022-01-18 23:12:52,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:52,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368785616] [2022-01-18 23:12:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:52,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:52,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:52,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368785616] [2022-01-18 23:12:52,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368785616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:52,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:12:52,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-18 23:12:52,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930246599] [2022-01-18 23:12:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:52,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-18 23:12:52,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-18 23:12:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-01-18 23:12:52,837 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 581 [2022-01-18 23:12:52,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 537 transitions, 1111 flow. Second operand has 17 states, 17 states have (on average 398.6470588235294) internal successors, (6777), 17 states have internal predecessors, (6777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:52,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:52,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 581 [2022-01-18 23:12:52,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:55,846 INFO L129 PetriNetUnfolder]: 3434/16113 cut-off events. [2022-01-18 23:12:55,849 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-18 23:12:55,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21784 conditions, 16113 events. 3434/16113 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 165772 event pairs, 1635 based on Foata normal form. 0/14403 useless extension candidates. Maximal degree in co-relation 21685. Up to 4518 conditions per place. [2022-01-18 23:12:55,942 INFO L132 encePairwiseOnDemand]: 563/581 looper letters, 265 selfloop transitions, 21 changer transitions 0/681 dead transitions. [2022-01-18 23:12:55,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 681 transitions, 1971 flow [2022-01-18 23:12:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 23:12:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-18 23:12:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 6230 transitions. [2022-01-18 23:12:55,957 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.714859437751004 [2022-01-18 23:12:55,957 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 6230 transitions. [2022-01-18 23:12:55,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 6230 transitions. [2022-01-18 23:12:55,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:55,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 6230 transitions. [2022-01-18 23:12:55,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 415.3333333333333) internal successors, (6230), 15 states have internal predecessors, (6230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:55,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 581.0) internal successors, (9296), 16 states have internal predecessors, (9296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:55,996 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 581.0) internal successors, (9296), 16 states have internal predecessors, (9296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:55,997 INFO L186 Difference]: Start difference. First operand has 521 places, 537 transitions, 1111 flow. Second operand 15 states and 6230 transitions. [2022-01-18 23:12:55,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 681 transitions, 1971 flow [2022-01-18 23:12:56,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 681 transitions, 1967 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 23:12:56,009 INFO L242 Difference]: Finished difference. Result has 538 places, 548 transitions, 1213 flow [2022-01-18 23:12:56,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1213, PETRI_PLACES=538, PETRI_TRANSITIONS=548} [2022-01-18 23:12:56,011 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 24 predicate places. [2022-01-18 23:12:56,012 INFO L470 AbstractCegarLoop]: Abstraction has has 538 places, 548 transitions, 1213 flow [2022-01-18 23:12:56,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 398.6470588235294) internal successors, (6777), 17 states have internal predecessors, (6777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:56,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:56,014 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:56,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 23:12:56,014 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1746328945, now seen corresponding path program 1 times [2022-01-18 23:12:56,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:56,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787220870] [2022-01-18 23:12:56,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:56,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:12:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:12:56,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:12:56,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787220870] [2022-01-18 23:12:56,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787220870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:12:56,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:12:56,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 23:12:56,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378966465] [2022-01-18 23:12:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:12:56,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 23:12:56,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:12:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 23:12:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-01-18 23:12:56,916 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 581 [2022-01-18 23:12:56,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 548 transitions, 1213 flow. Second operand has 18 states, 18 states have (on average 398.55555555555554) internal successors, (7174), 18 states have internal predecessors, (7174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:56,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:12:56,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 581 [2022-01-18 23:12:56,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:12:59,716 INFO L129 PetriNetUnfolder]: 3450/16305 cut-off events. [2022-01-18 23:12:59,716 INFO L130 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-01-18 23:12:59,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22669 conditions, 16305 events. 3450/16305 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 169488 event pairs, 1660 based on Foata normal form. 0/14704 useless extension candidates. Maximal degree in co-relation 22559. Up to 4595 conditions per place. [2022-01-18 23:12:59,800 INFO L132 encePairwiseOnDemand]: 563/581 looper letters, 264 selfloop transitions, 24 changer transitions 0/686 dead transitions. [2022-01-18 23:12:59,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 686 transitions, 2086 flow [2022-01-18 23:12:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 23:12:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 23:12:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6625 transitions. [2022-01-18 23:12:59,814 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7126721170395869 [2022-01-18 23:12:59,814 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 6625 transitions. [2022-01-18 23:12:59,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 6625 transitions. [2022-01-18 23:12:59,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:12:59,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 6625 transitions. [2022-01-18 23:12:59,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 414.0625) internal successors, (6625), 16 states have internal predecessors, (6625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:59,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 581.0) internal successors, (9877), 17 states have internal predecessors, (9877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:59,848 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 581.0) internal successors, (9877), 17 states have internal predecessors, (9877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:59,848 INFO L186 Difference]: Start difference. First operand has 538 places, 548 transitions, 1213 flow. Second operand 16 states and 6625 transitions. [2022-01-18 23:12:59,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 686 transitions, 2086 flow [2022-01-18 23:12:59,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 686 transitions, 2068 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-18 23:12:59,865 INFO L242 Difference]: Finished difference. Result has 549 places, 554 transitions, 1288 flow [2022-01-18 23:12:59,865 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1288, PETRI_PLACES=549, PETRI_TRANSITIONS=554} [2022-01-18 23:12:59,866 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 35 predicate places. [2022-01-18 23:12:59,867 INFO L470 AbstractCegarLoop]: Abstraction has has 549 places, 554 transitions, 1288 flow [2022-01-18 23:12:59,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 398.55555555555554) internal successors, (7174), 18 states have internal predecessors, (7174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:12:59,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:12:59,870 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:12:59,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 23:12:59,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:12:59,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:12:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1091126161, now seen corresponding path program 1 times [2022-01-18 23:12:59,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:12:59,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89696731] [2022-01-18 23:12:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:12:59,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:12:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:13:00,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:13:00,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89696731] [2022-01-18 23:13:00,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89696731] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:13:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797633012] [2022-01-18 23:13:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:00,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:13:00,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:13:00,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 23:13:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:00,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-18 23:13:00,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:13:01,318 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:01,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:01,415 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:01,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:01,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:01,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:01,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:01,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:01,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:01,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,199 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 23:13:02,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 23:13:02,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:13:02,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:02,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:13:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:02,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:13:02,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_657) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-01-18 23:13:02,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_656) |c_~#pre~0.base| v_ArrVal_657) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-01-18 23:13:06,409 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:06,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1190 treesize of output 1160 [2022-01-18 23:13:06,464 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:06,465 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 1106 treesize of output 1094 [2022-01-18 23:13:06,487 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:06,487 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 1094 treesize of output 1046 [2022-01-18 23:13:06,507 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:06,508 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 1046 treesize of output 950 [2022-01-18 23:13:06,535 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:06,536 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 726 treesize of output 702 [2022-01-18 23:13:08,111 INFO L353 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2022-01-18 23:13:08,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 146 [2022-01-18 23:13:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:08,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797633012] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:13:08,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:13:08,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 53 [2022-01-18 23:13:08,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674527906] [2022-01-18 23:13:08,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:13:08,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-18 23:13:08,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:13:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-18 23:13:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2090, Unknown=48, NotChecked=198, Total=2756 [2022-01-18 23:13:08,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 581 [2022-01-18 23:13:08,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 554 transitions, 1288 flow. Second operand has 53 states, 53 states have (on average 398.6981132075472) internal successors, (21131), 53 states have internal predecessors, (21131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:08,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:13:08,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 581 [2022-01-18 23:13:08,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:13:12,840 INFO L129 PetriNetUnfolder]: 3780/17523 cut-off events. [2022-01-18 23:13:12,840 INFO L130 PetriNetUnfolder]: For 1911/1913 co-relation queries the response was YES. [2022-01-18 23:13:12,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25124 conditions, 17523 events. 3780/17523 cut-off events. For 1911/1913 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 185299 event pairs, 1411 based on Foata normal form. 61/15984 useless extension candidates. Maximal degree in co-relation 25008. Up to 4554 conditions per place. [2022-01-18 23:13:12,977 INFO L132 encePairwiseOnDemand]: 548/581 looper letters, 383 selfloop transitions, 70 changer transitions 0/851 dead transitions. [2022-01-18 23:13:12,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 851 transitions, 2869 flow [2022-01-18 23:13:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-18 23:13:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-18 23:13:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10748 transitions. [2022-01-18 23:13:12,998 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7115053621077717 [2022-01-18 23:13:12,999 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 10748 transitions. [2022-01-18 23:13:12,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 10748 transitions. [2022-01-18 23:13:13,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:13:13,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 10748 transitions. [2022-01-18 23:13:13,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 413.38461538461536) internal successors, (10748), 26 states have internal predecessors, (10748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:13,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 581.0) internal successors, (15687), 27 states have internal predecessors, (15687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:13,045 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 581.0) internal successors, (15687), 27 states have internal predecessors, (15687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:13,045 INFO L186 Difference]: Start difference. First operand has 549 places, 554 transitions, 1288 flow. Second operand 26 states and 10748 transitions. [2022-01-18 23:13:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 851 transitions, 2869 flow [2022-01-18 23:13:13,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 851 transitions, 2837 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-01-18 23:13:13,065 INFO L242 Difference]: Finished difference. Result has 571 places, 597 transitions, 1701 flow [2022-01-18 23:13:13,066 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1701, PETRI_PLACES=571, PETRI_TRANSITIONS=597} [2022-01-18 23:13:13,068 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 57 predicate places. [2022-01-18 23:13:13,069 INFO L470 AbstractCegarLoop]: Abstraction has has 571 places, 597 transitions, 1701 flow [2022-01-18 23:13:13,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 398.6981132075472) internal successors, (21131), 53 states have internal predecessors, (21131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:13,074 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:13:13,074 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:13:13,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 23:13:13,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:13,297 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:13:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:13:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 604174216, now seen corresponding path program 1 times [2022-01-18 23:13:13,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:13:13,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782722722] [2022-01-18 23:13:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:13,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:13:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:13:13,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:13:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782722722] [2022-01-18 23:13:13,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782722722] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:13:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133800130] [2022-01-18 23:13:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:13,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:13,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:13:13,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:13:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 23:13:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:14,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 23:13:14,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:13:14,429 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:14,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:14,507 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:14,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:14,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:14,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,093 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 23:13:15,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 23:13:15,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:13:15,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:13:15,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 23:13:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:15,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:13:15,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_831) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:13:15,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_830) |c_~#pre~0.base| v_ArrVal_831) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:13:17,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2190 treesize of output 2154 [2022-01-18 23:13:17,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2070 treesize of output 2054 [2022-01-18 23:13:17,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2054 treesize of output 1926 [2022-01-18 23:13:17,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1926 treesize of output 1862 [2022-01-18 23:13:17,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1862 treesize of output 1830 [2022-01-18 23:13:23,401 INFO L353 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2022-01-18 23:13:23,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 146 [2022-01-18 23:13:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-18 23:13:23,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133800130] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:13:23,505 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:13:23,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 41 [2022-01-18 23:13:23,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421692863] [2022-01-18 23:13:23,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:13:23,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-18 23:13:23,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:13:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-18 23:13:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1151, Unknown=37, NotChecked=150, Total=1640 [2022-01-18 23:13:23,518 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 581 [2022-01-18 23:13:23,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 597 transitions, 1701 flow. Second operand has 41 states, 41 states have (on average 398.0487804878049) internal successors, (16320), 41 states have internal predecessors, (16320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:23,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:13:23,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 581 [2022-01-18 23:13:23,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:13:29,036 INFO L129 PetriNetUnfolder]: 7110/33192 cut-off events. [2022-01-18 23:13:29,036 INFO L130 PetriNetUnfolder]: For 6250/6335 co-relation queries the response was YES. [2022-01-18 23:13:29,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48808 conditions, 33192 events. 7110/33192 cut-off events. For 6250/6335 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 394814 event pairs, 2614 based on Foata normal form. 43/29894 useless extension candidates. Maximal degree in co-relation 48681. Up to 5979 conditions per place. [2022-01-18 23:13:29,285 INFO L132 encePairwiseOnDemand]: 555/581 looper letters, 503 selfloop transitions, 48 changer transitions 0/964 dead transitions. [2022-01-18 23:13:29,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 964 transitions, 3685 flow [2022-01-18 23:13:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-18 23:13:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-18 23:13:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 8410 transitions. [2022-01-18 23:13:29,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7237521514629949 [2022-01-18 23:13:29,300 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 8410 transitions. [2022-01-18 23:13:29,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 8410 transitions. [2022-01-18 23:13:29,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:13:29,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 8410 transitions. [2022-01-18 23:13:29,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 420.5) internal successors, (8410), 20 states have internal predecessors, (8410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:29,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 581.0) internal successors, (12201), 21 states have internal predecessors, (12201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:29,331 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 581.0) internal successors, (12201), 21 states have internal predecessors, (12201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:29,331 INFO L186 Difference]: Start difference. First operand has 571 places, 597 transitions, 1701 flow. Second operand 20 states and 8410 transitions. [2022-01-18 23:13:29,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 964 transitions, 3685 flow [2022-01-18 23:13:29,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 964 transitions, 3582 flow, removed 27 selfloop flow, removed 13 redundant places. [2022-01-18 23:13:29,367 INFO L242 Difference]: Finished difference. Result has 584 places, 627 transitions, 1887 flow [2022-01-18 23:13:29,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1887, PETRI_PLACES=584, PETRI_TRANSITIONS=627} [2022-01-18 23:13:29,368 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 70 predicate places. [2022-01-18 23:13:29,368 INFO L470 AbstractCegarLoop]: Abstraction has has 584 places, 627 transitions, 1887 flow [2022-01-18 23:13:29,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 398.0487804878049) internal successors, (16320), 41 states have internal predecessors, (16320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:29,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:13:29,374 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:13:29,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 23:13:29,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:29,587 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:13:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:13:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1424505469, now seen corresponding path program 1 times [2022-01-18 23:13:29,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:13:29,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514855831] [2022-01-18 23:13:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:29,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:13:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:13:30,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:13:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514855831] [2022-01-18 23:13:30,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514855831] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:13:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697177236] [2022-01-18 23:13:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:30,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:30,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:13:30,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:13:30,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 23:13:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:30,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-18 23:13:30,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:13:30,861 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:30,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:30,932 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:13:30,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:13:31,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,534 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 23:13:31,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 23:13:31,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:31,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:13:31,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:13:32,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:13:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:32,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:13:32,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1005) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-01-18 23:13:32,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1004 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1004) |c_~#pre~0.base| v_ArrVal_1005) |c_~#post~0.base|))) (or (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0))))) is different from false [2022-01-18 23:13:34,875 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:34,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4766 treesize of output 4676 [2022-01-18 23:13:34,967 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:34,967 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 4484 treesize of output 4100 [2022-01-18 23:13:34,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:13:34,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3074 treesize of output 3026 [2022-01-18 23:13:35,021 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:35,021 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 4052 treesize of output 3956 [2022-01-18 23:13:35,078 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:13:35,079 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 3956 treesize of output 3764 [2022-01-18 23:13:39,984 INFO L353 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2022-01-18 23:13:39,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 90 [2022-01-18 23:13:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:40,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697177236] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:13:40,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:13:40,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 53 [2022-01-18 23:13:40,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472162584] [2022-01-18 23:13:40,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:13:40,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-18 23:13:40,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:13:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-18 23:13:40,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2144, Unknown=42, NotChecked=198, Total=2756 [2022-01-18 23:13:40,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 581 [2022-01-18 23:13:40,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 627 transitions, 1887 flow. Second operand has 53 states, 53 states have (on average 398.75471698113205) internal successors, (21134), 53 states have internal predecessors, (21134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:40,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:13:40,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 581 [2022-01-18 23:13:40,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:13:46,916 INFO L129 PetriNetUnfolder]: 6798/33137 cut-off events. [2022-01-18 23:13:46,916 INFO L130 PetriNetUnfolder]: For 10450/10649 co-relation queries the response was YES. [2022-01-18 23:13:47,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51383 conditions, 33137 events. 6798/33137 cut-off events. For 10450/10649 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 397462 event pairs, 3369 based on Foata normal form. 111/30104 useless extension candidates. Maximal degree in co-relation 51329. Up to 9174 conditions per place. [2022-01-18 23:13:47,130 INFO L132 encePairwiseOnDemand]: 548/581 looper letters, 415 selfloop transitions, 77 changer transitions 0/909 dead transitions. [2022-01-18 23:13:47,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 909 transitions, 3741 flow [2022-01-18 23:13:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-18 23:13:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-18 23:13:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 11143 transitions. [2022-01-18 23:13:47,144 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.710333397080385 [2022-01-18 23:13:47,144 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 11143 transitions. [2022-01-18 23:13:47,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 11143 transitions. [2022-01-18 23:13:47,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:13:47,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 11143 transitions. [2022-01-18 23:13:47,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 412.7037037037037) internal successors, (11143), 27 states have internal predecessors, (11143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:47,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 581.0) internal successors, (16268), 28 states have internal predecessors, (16268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:47,172 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 581.0) internal successors, (16268), 28 states have internal predecessors, (16268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:47,172 INFO L186 Difference]: Start difference. First operand has 584 places, 627 transitions, 1887 flow. Second operand 27 states and 11143 transitions. [2022-01-18 23:13:47,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 909 transitions, 3741 flow [2022-01-18 23:13:47,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 909 transitions, 3728 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-18 23:13:47,218 INFO L242 Difference]: Finished difference. Result has 608 places, 651 transitions, 2301 flow [2022-01-18 23:13:47,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2301, PETRI_PLACES=608, PETRI_TRANSITIONS=651} [2022-01-18 23:13:47,219 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 94 predicate places. [2022-01-18 23:13:47,220 INFO L470 AbstractCegarLoop]: Abstraction has has 608 places, 651 transitions, 2301 flow [2022-01-18 23:13:47,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 398.75471698113205) internal successors, (21134), 53 states have internal predecessors, (21134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:47,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:13:47,224 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:13:47,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 23:13:47,447 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,SelfDestructingSolverStorable9 [2022-01-18 23:13:47,447 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:13:47,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:13:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1263386810, now seen corresponding path program 1 times [2022-01-18 23:13:47,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:13:47,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173520468] [2022-01-18 23:13:47,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:47,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:13:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:13:48,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:13:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173520468] [2022-01-18 23:13:48,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173520468] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:13:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939572578] [2022-01-18 23:13:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:13:48,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:13:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:13:48,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:13:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 23:13:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:13:48,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-18 23:13:48,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:13:48,689 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-18 23:13:48,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-01-18 23:13:48,796 INFO L353 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-01-18 23:13:48,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-01-18 23:13:48,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:49,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:50,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:50,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:50,376 INFO L353 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-01-18 23:13:50,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-01-18 23:13:50,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:50,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:13:50,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:13:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:50,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:13:53,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:13:53,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:13:53,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:13:53,906 INFO L353 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-01-18 23:13:53,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2352 treesize of output 2308 [2022-01-18 23:13:54,005 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:13:54,006 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 2182 treesize of output 2060 [2022-01-18 23:13:54,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2046 treesize of output 2030 [2022-01-18 23:13:54,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2030 treesize of output 1966 [2022-01-18 23:13:54,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1966 treesize of output 1934 [2022-01-18 23:13:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:13:55,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939572578] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:13:55,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:13:55,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 56 [2022-01-18 23:13:55,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258914049] [2022-01-18 23:13:55,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:13:55,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-18 23:13:55,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:13:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-18 23:13:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2442, Unknown=63, NotChecked=0, Total=3080 [2022-01-18 23:13:55,022 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 581 [2022-01-18 23:13:55,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 651 transitions, 2301 flow. Second operand has 56 states, 56 states have (on average 393.57142857142856) internal successors, (22040), 56 states have internal predecessors, (22040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:13:55,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:13:55,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 581 [2022-01-18 23:13:55,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:14:01,003 INFO L129 PetriNetUnfolder]: 7851/36840 cut-off events. [2022-01-18 23:14:01,004 INFO L130 PetriNetUnfolder]: For 17573/17786 co-relation queries the response was YES. [2022-01-18 23:14:01,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60081 conditions, 36840 events. 7851/36840 cut-off events. For 17573/17786 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 444769 event pairs, 4390 based on Foata normal form. 92/33323 useless extension candidates. Maximal degree in co-relation 60020. Up to 12012 conditions per place. [2022-01-18 23:14:01,285 INFO L132 encePairwiseOnDemand]: 542/581 looper letters, 406 selfloop transitions, 63 changer transitions 0/885 dead transitions. [2022-01-18 23:14:01,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 885 transitions, 4248 flow [2022-01-18 23:14:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-18 23:14:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-18 23:14:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10515 transitions. [2022-01-18 23:14:01,296 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6960810274063286 [2022-01-18 23:14:01,296 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 10515 transitions. [2022-01-18 23:14:01,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 10515 transitions. [2022-01-18 23:14:01,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:14:01,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 10515 transitions. [2022-01-18 23:14:01,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 404.4230769230769) internal successors, (10515), 26 states have internal predecessors, (10515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:01,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 581.0) internal successors, (15687), 27 states have internal predecessors, (15687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:01,322 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 581.0) internal successors, (15687), 27 states have internal predecessors, (15687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:01,322 INFO L186 Difference]: Start difference. First operand has 608 places, 651 transitions, 2301 flow. Second operand 26 states and 10515 transitions. [2022-01-18 23:14:01,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 885 transitions, 4248 flow [2022-01-18 23:14:01,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 885 transitions, 4035 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-01-18 23:14:01,379 INFO L242 Difference]: Finished difference. Result has 625 places, 699 transitions, 2781 flow [2022-01-18 23:14:01,380 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2781, PETRI_PLACES=625, PETRI_TRANSITIONS=699} [2022-01-18 23:14:01,380 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 111 predicate places. [2022-01-18 23:14:01,380 INFO L470 AbstractCegarLoop]: Abstraction has has 625 places, 699 transitions, 2781 flow [2022-01-18 23:14:01,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 393.57142857142856) internal successors, (22040), 56 states have internal predecessors, (22040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:01,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:14:01,383 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:14:01,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 23:14:01,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:14:01,585 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:14:01,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:14:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1202553437, now seen corresponding path program 1 times [2022-01-18 23:14:01,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:14:01,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521438606] [2022-01-18 23:14:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:14:01,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:14:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:14:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:14:02,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:14:02,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521438606] [2022-01-18 23:14:02,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521438606] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:14:02,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439515374] [2022-01-18 23:14:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:14:02,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:14:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:14:02,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:14:02,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 23:14:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:14:02,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-18 23:14:02,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:14:03,065 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-18 23:14:03,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-01-18 23:14:03,185 INFO L353 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-01-18 23:14:03,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-01-18 23:14:03,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:03,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:03,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:03,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:03,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:03,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,438 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-18 23:14:04,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-01-18 23:14:04,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:14:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:14:04,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:05,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:14:05,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:14:05,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-18 23:14:05,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:14:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:14:05,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:14:05,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1367 (Array Int Int))) (= 0 (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1367) |c_~#post~0.base|) (+ |c_~#post~0.offset| |c_ULTIMATE.start_worker_fn_~i~0#1|)) 256))) is different from false [2022-01-18 23:14:05,311 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1367 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1367) |c_~#post~0.base|) |c_~#post~0.offset|) 256) 0)) (forall ((v_ArrVal_1366 (Array Int Int))) (not (<= (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1366) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)))) is different from false [2022-01-18 23:14:05,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1365 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1365))) (or (not (<= (mod (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1366) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) (= (mod (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1367) |c_~#post~0.base|) |c_~#post~0.offset|) 256) 0)))) is different from false [2022-01-18 23:14:09,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:14:09,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:14:09,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:14:09,349 INFO L353 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-01-18 23:14:09,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 612 treesize of output 592 [2022-01-18 23:14:09,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 536 treesize of output 504 [2022-01-18 23:14:09,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 504 treesize of output 488 [2022-01-18 23:14:09,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 488 treesize of output 480 [2022-01-18 23:14:09,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 480 treesize of output 476 [2022-01-18 23:14:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-18 23:14:09,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439515374] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:14:09,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:14:09,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 22] total 54 [2022-01-18 23:14:09,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666793488] [2022-01-18 23:14:09,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:14:09,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 23:14:09,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:14:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 23:14:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2041, Unknown=47, NotChecked=300, Total=2862 [2022-01-18 23:14:09,572 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 581 [2022-01-18 23:14:09,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 699 transitions, 2781 flow. Second operand has 54 states, 54 states have (on average 393.7037037037037) internal successors, (21260), 54 states have internal predecessors, (21260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:09,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:14:09,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 581 [2022-01-18 23:14:09,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:14:16,366 INFO L129 PetriNetUnfolder]: 7922/36996 cut-off events. [2022-01-18 23:14:16,366 INFO L130 PetriNetUnfolder]: For 19745/19985 co-relation queries the response was YES. [2022-01-18 23:14:16,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63297 conditions, 36996 events. 7922/36996 cut-off events. For 19745/19985 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 447365 event pairs, 4564 based on Foata normal form. 130/33567 useless extension candidates. Maximal degree in co-relation 63230. Up to 11845 conditions per place. [2022-01-18 23:14:16,639 INFO L132 encePairwiseOnDemand]: 556/581 looper letters, 347 selfloop transitions, 67 changer transitions 0/830 dead transitions. [2022-01-18 23:14:16,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 830 transitions, 4084 flow [2022-01-18 23:14:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-18 23:14:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-18 23:14:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 9669 transitions. [2022-01-18 23:14:16,648 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6934165232358004 [2022-01-18 23:14:16,648 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 9669 transitions. [2022-01-18 23:14:16,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 9669 transitions. [2022-01-18 23:14:16,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:14:16,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 9669 transitions. [2022-01-18 23:14:16,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 402.875) internal successors, (9669), 24 states have internal predecessors, (9669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:16,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 581.0) internal successors, (14525), 25 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:16,672 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 581.0) internal successors, (14525), 25 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:16,672 INFO L186 Difference]: Start difference. First operand has 625 places, 699 transitions, 2781 flow. Second operand 24 states and 9669 transitions. [2022-01-18 23:14:16,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 830 transitions, 4084 flow [2022-01-18 23:14:16,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 830 transitions, 4052 flow, removed 2 selfloop flow, removed 14 redundant places. [2022-01-18 23:14:16,743 INFO L242 Difference]: Finished difference. Result has 639 places, 707 transitions, 3035 flow [2022-01-18 23:14:16,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=2749, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3035, PETRI_PLACES=639, PETRI_TRANSITIONS=707} [2022-01-18 23:14:16,745 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 125 predicate places. [2022-01-18 23:14:16,745 INFO L470 AbstractCegarLoop]: Abstraction has has 639 places, 707 transitions, 3035 flow [2022-01-18 23:14:16,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 393.7037037037037) internal successors, (21260), 54 states have internal predecessors, (21260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:14:16,748 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:14:16,748 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:14:16,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 23:14:16,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:14:16,960 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:14:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:14:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 571573063, now seen corresponding path program 1 times [2022-01-18 23:14:16,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:14:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169134950] [2022-01-18 23:14:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:14:16,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:14:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:14:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:14:17,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:14:17,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169134950] [2022-01-18 23:14:17,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169134950] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:14:17,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234402103] [2022-01-18 23:14:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:14:17,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:14:17,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:14:17,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:14:17,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 23:14:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:14:17,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-18 23:14:17,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:14:18,163 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:14:18,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:14:18,225 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:14:18,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:14:18,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:18,804 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 23:14:18,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 23:14:18,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:14:19,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:14:19,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:14:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:14:19,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:14:19,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1542 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1542) |c_~#in~0.base|))) (or (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0))))) is different from false [2022-01-18 23:14:19,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1541) |c_~#pre~0.base| v_ArrVal_1542) |c_~#in~0.base|))) (or (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0))))) is different from false [2022-01-18 23:14:22,740 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:14:22,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2382 treesize of output 2332 [2022-01-18 23:14:22,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:14:22,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1658 treesize of output 1562 [2022-01-18 23:14:22,803 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:14:22,804 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 2136 treesize of output 2112 [2022-01-18 23:14:22,818 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:14:22,819 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 2112 treesize of output 1920 [2022-01-18 23:14:22,833 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:14:22,833 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 1920 treesize of output 1872 [2022-01-18 23:17:53,186 INFO L353 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2022-01-18 23:17:53,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 146 [2022-01-18 23:17:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-18 23:17:53,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234402103] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:17:53,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:17:53,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 53 [2022-01-18 23:17:53,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438947704] [2022-01-18 23:17:53,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:17:53,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-18 23:17:53,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:17:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-18 23:17:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2090, Unknown=47, NotChecked=198, Total=2756 [2022-01-18 23:17:53,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 581 [2022-01-18 23:17:53,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 707 transitions, 3035 flow. Second operand has 53 states, 53 states have (on average 397.811320754717) internal successors, (21084), 53 states have internal predecessors, (21084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:17:53,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:17:53,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 581 [2022-01-18 23:17:53,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:18:00,624 INFO L129 PetriNetUnfolder]: 7565/35873 cut-off events. [2022-01-18 23:18:00,624 INFO L130 PetriNetUnfolder]: For 21266/21500 co-relation queries the response was YES. [2022-01-18 23:18:00,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61428 conditions, 35873 events. 7565/35873 cut-off events. For 21266/21500 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 433653 event pairs, 4085 based on Foata normal form. 197/32700 useless extension candidates. Maximal degree in co-relation 61355. Up to 11158 conditions per place. [2022-01-18 23:18:00,956 INFO L132 encePairwiseOnDemand]: 549/581 looper letters, 351 selfloop transitions, 79 changer transitions 0/861 dead transitions. [2022-01-18 23:18:00,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 861 transitions, 4463 flow [2022-01-18 23:18:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-18 23:18:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-18 23:18:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8614 transitions. [2022-01-18 23:18:00,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7060077042865339 [2022-01-18 23:18:00,964 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 8614 transitions. [2022-01-18 23:18:00,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 8614 transitions. [2022-01-18 23:18:00,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:18:00,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 8614 transitions. [2022-01-18 23:18:00,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 410.1904761904762) internal successors, (8614), 21 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:00,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 581.0) internal successors, (12782), 22 states have internal predecessors, (12782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:00,983 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 581.0) internal successors, (12782), 22 states have internal predecessors, (12782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:00,983 INFO L186 Difference]: Start difference. First operand has 639 places, 707 transitions, 3035 flow. Second operand 21 states and 8614 transitions. [2022-01-18 23:18:00,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 861 transitions, 4463 flow [2022-01-18 23:18:01,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 861 transitions, 4412 flow, removed 2 selfloop flow, removed 17 redundant places. [2022-01-18 23:18:01,059 INFO L242 Difference]: Finished difference. Result has 644 places, 715 transitions, 3331 flow [2022-01-18 23:18:01,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=2931, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3331, PETRI_PLACES=644, PETRI_TRANSITIONS=715} [2022-01-18 23:18:01,060 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 130 predicate places. [2022-01-18 23:18:01,060 INFO L470 AbstractCegarLoop]: Abstraction has has 644 places, 715 transitions, 3331 flow [2022-01-18 23:18:01,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 397.811320754717) internal successors, (21084), 53 states have internal predecessors, (21084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:01,064 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:18:01,064 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:18:01,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 23:18:01,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 23:18:01,279 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:18:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:18:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1821726937, now seen corresponding path program 1 times [2022-01-18 23:18:01,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:18:01,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139966315] [2022-01-18 23:18:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:18:01,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:18:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:18:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 23:18:01,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:18:01,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139966315] [2022-01-18 23:18:01,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139966315] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:18:01,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146974769] [2022-01-18 23:18:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:18:01,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:18:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:18:01,988 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:18:01,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 23:18:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:18:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-18 23:18:02,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:18:02,431 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:18:02,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:18:02,518 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 23:18:02,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 23:18:02,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:02,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:03,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:03,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:03,080 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 23:18:03,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 23:18:03,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:03,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-18 23:18:03,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-18 23:18:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 23:18:03,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:18:03,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1716) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-01-18 23:18:03,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1715) |c_~#pre~0.base| v_ArrVal_1716) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-01-18 23:18:06,544 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:18:06,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1190 treesize of output 1160 [2022-01-18 23:18:06,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 23:18:06,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 822 treesize of output 810 [2022-01-18 23:18:06,606 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:18:06,606 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 1094 treesize of output 998 [2022-01-18 23:18:06,616 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:18:06,616 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 998 treesize of output 950 [2022-01-18 23:18:06,625 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-18 23:18:06,626 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 950 treesize of output 926 [2022-01-18 23:18:07,447 INFO L353 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2022-01-18 23:18:07,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 90 [2022-01-18 23:18:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-18 23:18:07,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146974769] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:18:07,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:18:07,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 53 [2022-01-18 23:18:07,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052934063] [2022-01-18 23:18:07,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:18:07,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-18 23:18:07,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:18:07,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-18 23:18:07,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2145, Unknown=43, NotChecked=198, Total=2756 [2022-01-18 23:18:07,559 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 581 [2022-01-18 23:18:07,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 715 transitions, 3331 flow. Second operand has 53 states, 53 states have (on average 397.8679245283019) internal successors, (21087), 53 states have internal predecessors, (21087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:07,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:18:07,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 581 [2022-01-18 23:18:07,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:18:15,497 INFO L129 PetriNetUnfolder]: 8081/38442 cut-off events. [2022-01-18 23:18:15,497 INFO L130 PetriNetUnfolder]: For 26218/26452 co-relation queries the response was YES. [2022-01-18 23:18:15,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67104 conditions, 38442 events. 8081/38442 cut-off events. For 26218/26452 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 472589 event pairs, 3564 based on Foata normal form. 165/35116 useless extension candidates. Maximal degree in co-relation 67029. Up to 10573 conditions per place. [2022-01-18 23:18:15,945 INFO L132 encePairwiseOnDemand]: 548/581 looper letters, 434 selfloop transitions, 105 changer transitions 0/973 dead transitions. [2022-01-18 23:18:15,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 973 transitions, 5351 flow [2022-01-18 23:18:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-18 23:18:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-18 23:18:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 9483 transitions. [2022-01-18 23:18:15,954 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7096460375664148 [2022-01-18 23:18:15,954 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 9483 transitions. [2022-01-18 23:18:15,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 9483 transitions. [2022-01-18 23:18:15,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:18:15,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 9483 transitions. [2022-01-18 23:18:15,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 412.30434782608694) internal successors, (9483), 23 states have internal predecessors, (9483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:15,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 581.0) internal successors, (13944), 24 states have internal predecessors, (13944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:15,974 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 581.0) internal successors, (13944), 24 states have internal predecessors, (13944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:15,975 INFO L186 Difference]: Start difference. First operand has 644 places, 715 transitions, 3331 flow. Second operand 23 states and 9483 transitions. [2022-01-18 23:18:15,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 973 transitions, 5351 flow [2022-01-18 23:18:16,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 973 transitions, 5275 flow, removed 8 selfloop flow, removed 15 redundant places. [2022-01-18 23:18:16,066 INFO L242 Difference]: Finished difference. Result has 655 places, 746 transitions, 3825 flow [2022-01-18 23:18:16,067 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=3257, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3825, PETRI_PLACES=655, PETRI_TRANSITIONS=746} [2022-01-18 23:18:16,068 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 141 predicate places. [2022-01-18 23:18:16,068 INFO L470 AbstractCegarLoop]: Abstraction has has 655 places, 746 transitions, 3825 flow [2022-01-18 23:18:16,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 397.8679245283019) internal successors, (21087), 53 states have internal predecessors, (21087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:16,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:18:16,071 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:18:16,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 23:18:16,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 23:18:16,296 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:18:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:18:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1263562280, now seen corresponding path program 1 times [2022-01-18 23:18:16,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:18:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259498864] [2022-01-18 23:18:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:18:16,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:18:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:18:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 23:18:18,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:18:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259498864] [2022-01-18 23:18:18,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259498864] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:18:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249581212] [2022-01-18 23:18:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:18:18,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:18:18,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:18:18,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:18:18,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 23:18:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:18:19,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-18 23:18:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:18:19,244 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-18 23:18:19,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 33 [2022-01-18 23:18:19,339 INFO L353 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-01-18 23:18:19,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-01-18 23:18:19,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-01-18 23:18:19,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:19,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:18:19,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:19,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:18:19,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:19,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:18:19,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:19,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-18 23:18:20,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:20,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:20,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:20,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-01-18 23:18:20,672 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:18:20,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2022-01-18 23:18:20,713 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:18:20,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2022-01-18 23:18:20,753 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:18:20,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2022-01-18 23:18:20,805 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:18:20,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 78 [2022-01-18 23:18:20,990 INFO L353 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-01-18 23:18:20,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 41 [2022-01-18 23:18:21,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-01-18 23:18:22,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-01-18 23:18:22,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:18:22,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2022-01-18 23:18:23,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:18:23,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:18:23,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 23:18:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-18 23:18:23,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:18:23,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int))) (<= (mod (select (select (store |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_1926) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) is different from false [2022-01-18 23:18:23,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int))) (<= (mod (select (select (store |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_1926) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:18:23,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= (mod (select (select (store (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1925) |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_1926) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:18:23,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= (mod (select (select (store (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1925) |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| v_ArrVal_1926) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:18:23,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= (mod (select (select (store (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1925) |c_worker_fnThread1of1ForFork0_#t~mem20#1.base| v_ArrVal_1926) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:18:23,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= (mod (select (select (store (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1925) (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_1926) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:18:23,589 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:18:23,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 88 [2022-01-18 23:18:23,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-01-18 23:18:23,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-01-18 23:18:23,722 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1924 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_1924) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:18:23,909 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (forall ((v_ArrVal_1924 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_1924) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_~#in~0.base|)))) is different from false [2022-01-18 23:18:23,915 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (not (= |c_~#in~0.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1923) |c_~#pre~0.base| v_ArrVal_1924) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|))))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:18:23,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1923) |c_~#pre~0.base| v_ArrVal_1924) |c_ULTIMATE.start_main_~#a~1#1.base|) |c_ULTIMATE.start_main_~#a~1#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:18:37,544 INFO L353 Elim1Store]: treesize reduction 524, result has 10.9 percent of original size [2022-01-18 23:18:37,545 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 5 case distinctions, treesize of input 65 treesize of output 86 [2022-01-18 23:18:37,583 INFO L353 Elim1Store]: treesize reduction 215, result has 8.9 percent of original size [2022-01-18 23:18:37,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 318 treesize of output 287 [2022-01-18 23:18:37,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 230 [2022-01-18 23:18:37,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 222 [2022-01-18 23:18:37,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 218 [2022-01-18 23:18:39,681 INFO L353 Elim1Store]: treesize reduction 54, result has 26.0 percent of original size [2022-01-18 23:18:39,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 48 [2022-01-18 23:18:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 5 not checked. [2022-01-18 23:18:39,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249581212] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:18:39,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:18:39,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 35] total 92 [2022-01-18 23:18:39,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262656388] [2022-01-18 23:18:39,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:18:39,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-18 23:18:39,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:18:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-18 23:18:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=6152, Unknown=63, NotChecked=1690, Total=8372 [2022-01-18 23:18:39,717 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 581 [2022-01-18 23:18:39,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 746 transitions, 3825 flow. Second operand has 92 states, 92 states have (on average 348.70652173913044) internal successors, (32081), 92 states have internal predecessors, (32081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:39,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:18:39,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 581 [2022-01-18 23:18:39,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:18:55,748 INFO L129 PetriNetUnfolder]: 16063/62415 cut-off events. [2022-01-18 23:18:55,748 INFO L130 PetriNetUnfolder]: For 71061/71255 co-relation queries the response was YES. [2022-01-18 23:18:56,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124863 conditions, 62415 events. 16063/62415 cut-off events. For 71061/71255 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 771282 event pairs, 8291 based on Foata normal form. 155/57270 useless extension candidates. Maximal degree in co-relation 124783. Up to 22821 conditions per place. [2022-01-18 23:18:56,516 INFO L132 encePairwiseOnDemand]: 532/581 looper letters, 784 selfloop transitions, 132 changer transitions 0/1283 dead transitions. [2022-01-18 23:18:56,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 1283 transitions, 8323 flow [2022-01-18 23:18:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 23:18:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-18 23:18:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16217 transitions. [2022-01-18 23:18:56,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6202715624402372 [2022-01-18 23:18:56,644 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 16217 transitions. [2022-01-18 23:18:56,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 16217 transitions. [2022-01-18 23:18:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:18:56,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 16217 transitions. [2022-01-18 23:18:56,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 360.3777777777778) internal successors, (16217), 45 states have internal predecessors, (16217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:56,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 581.0) internal successors, (26726), 46 states have internal predecessors, (26726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:56,696 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 581.0) internal successors, (26726), 46 states have internal predecessors, (26726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:56,696 INFO L186 Difference]: Start difference. First operand has 655 places, 746 transitions, 3825 flow. Second operand 45 states and 16217 transitions. [2022-01-18 23:18:56,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 1283 transitions, 8323 flow [2022-01-18 23:18:56,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 1283 transitions, 8115 flow, removed 54 selfloop flow, removed 17 redundant places. [2022-01-18 23:18:56,960 INFO L242 Difference]: Finished difference. Result has 703 places, 849 transitions, 4947 flow [2022-01-18 23:18:56,961 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4947, PETRI_PLACES=703, PETRI_TRANSITIONS=849} [2022-01-18 23:18:56,961 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 189 predicate places. [2022-01-18 23:18:56,961 INFO L470 AbstractCegarLoop]: Abstraction has has 703 places, 849 transitions, 4947 flow [2022-01-18 23:18:56,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 348.70652173913044) internal successors, (32081), 92 states have internal predecessors, (32081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:18:56,967 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:18:56,967 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:18:56,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 23:18:57,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 23:18:57,177 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:18:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:18:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 171644868, now seen corresponding path program 2 times [2022-01-18 23:18:57,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:18:57,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027816826] [2022-01-18 23:18:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:18:57,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:18:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 23:19:00,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027816826] [2022-01-18 23:19:00,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027816826] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:19:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110866185] [2022-01-18 23:19:00,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 23:19:00,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:19:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:19:00,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:19:00,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 23:19:00,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 23:19:00,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 23:19:00,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 97 conjunts are in the unsatisfiable core [2022-01-18 23:19:00,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:19:00,947 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-18 23:19:00,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 33 [2022-01-18 23:19:01,052 INFO L353 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-01-18 23:19:01,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 45 [2022-01-18 23:19:01,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-01-18 23:19:01,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:19:01,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:19:01,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:19:01,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:19:01,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:19:01,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:19:01,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:19:01,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-18 23:19:01,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:19:01,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-18 23:19:02,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:19:02,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:19:02,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:19:02,487 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:19:02,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-01-18 23:19:02,661 INFO L353 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-01-18 23:19:02,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2022-01-18 23:19:02,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-01-18 23:19:03,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-01-18 23:19:04,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-01-18 23:19:04,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:19:04,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-01-18 23:19:04,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:19:04,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 23:19:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-18 23:19:05,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:19:05,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2137 Int)) (<= (mod (select (select (store |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2137)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) is different from false [2022-01-18 23:19:06,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2137 Int)) (<= (mod (select (select (store |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| (store (select |c_#memory_int| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2137)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) is different from false [2022-01-18 23:19:06,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2137 Int)) (<= (mod (select (select (store |c_#memory_int| |c_worker_fnThread1of1ForFork0_#t~mem20#1.base| (store (select |c_#memory_int| |c_worker_fnThread1of1ForFork0_#t~mem20#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2137)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) is different from false [2022-01-18 23:19:11,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2137 Int)) (<= (mod (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2137))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:19:11,595 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2137 Int)) (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2135)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2136) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2137))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:19:11,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:19:11,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 456 treesize of output 425 [2022-01-18 23:19:11,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 440 [2022-01-18 23:19:12,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:19:12,138 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 60 treesize of output 62 [2022-01-18 23:19:12,250 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2136) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:19:12,270 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int))) (not (= |c_~#in~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2136) |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:19:12,373 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:19:12,379 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2133) |c_~#pre~0.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:19:12,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2133) |c_~#pre~0.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~#a~1#1.base|) |c_ULTIMATE.start_main_~#a~1#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:19:14,177 INFO L353 Elim1Store]: treesize reduction 524, result has 10.9 percent of original size [2022-01-18 23:19:14,177 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 5 case distinctions, treesize of input 65 treesize of output 86 [2022-01-18 23:19:14,207 INFO L353 Elim1Store]: treesize reduction 215, result has 8.9 percent of original size [2022-01-18 23:19:14,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 318 treesize of output 287 [2022-01-18 23:19:14,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 230 [2022-01-18 23:19:14,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 222 [2022-01-18 23:19:14,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 218 [2022-01-18 23:19:32,845 INFO L353 Elim1Store]: treesize reduction 54, result has 26.0 percent of original size [2022-01-18 23:19:32,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 48 [2022-01-18 23:19:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 5 not checked. [2022-01-18 23:19:32,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110866185] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:19:32,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:19:32,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 96 [2022-01-18 23:19:32,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539076349] [2022-01-18 23:19:32,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:19:32,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-01-18 23:19:32,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-01-18 23:19:32,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=6811, Unknown=97, NotChecked=1770, Total=9120 [2022-01-18 23:19:32,873 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 581 [2022-01-18 23:19:32,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 849 transitions, 4947 flow. Second operand has 96 states, 96 states have (on average 347.6979166666667) internal successors, (33379), 96 states have internal predecessors, (33379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:19:32,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:32,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 581 [2022-01-18 23:19:32,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:05,725 INFO L129 PetriNetUnfolder]: 22175/79605 cut-off events. [2022-01-18 23:20:05,726 INFO L130 PetriNetUnfolder]: For 153298/153623 co-relation queries the response was YES. [2022-01-18 23:20:07,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189367 conditions, 79605 events. 22175/79605 cut-off events. For 153298/153623 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 979000 event pairs, 10017 based on Foata normal form. 154/73971 useless extension candidates. Maximal degree in co-relation 189270. Up to 27581 conditions per place. [2022-01-18 23:20:07,304 INFO L132 encePairwiseOnDemand]: 524/581 looper letters, 1584 selfloop transitions, 570 changer transitions 0/2520 dead transitions. [2022-01-18 23:20:07,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 2520 transitions, 21810 flow [2022-01-18 23:20:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-01-18 23:20:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2022-01-18 23:20:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 42522 transitions. [2022-01-18 23:20:07,345 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6150219123794096 [2022-01-18 23:20:07,345 INFO L72 ComplementDD]: Start complementDD. Operand 119 states and 42522 transitions. [2022-01-18 23:20:07,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 42522 transitions. [2022-01-18 23:20:07,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:07,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 119 states and 42522 transitions. [2022-01-18 23:20:07,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 120 states, 119 states have (on average 357.327731092437) internal successors, (42522), 119 states have internal predecessors, (42522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:20:07,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 120 states, 120 states have (on average 581.0) internal successors, (69720), 120 states have internal predecessors, (69720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:20:07,480 INFO L81 ComplementDD]: Finished complementDD. Result has 120 states, 120 states have (on average 581.0) internal successors, (69720), 120 states have internal predecessors, (69720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:20:07,482 INFO L186 Difference]: Start difference. First operand has 703 places, 849 transitions, 4947 flow. Second operand 119 states and 42522 transitions. [2022-01-18 23:20:07,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 2520 transitions, 21810 flow [2022-01-18 23:20:08,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 2520 transitions, 21685 flow, removed 40 selfloop flow, removed 21 redundant places. [2022-01-18 23:20:08,706 INFO L242 Difference]: Finished difference. Result has 871 places, 1407 transitions, 13500 flow [2022-01-18 23:20:08,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=4870, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=119, PETRI_FLOW=13500, PETRI_PLACES=871, PETRI_TRANSITIONS=1407} [2022-01-18 23:20:08,708 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 357 predicate places. [2022-01-18 23:20:08,708 INFO L470 AbstractCegarLoop]: Abstraction has has 871 places, 1407 transitions, 13500 flow [2022-01-18 23:20:08,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 347.6979166666667) internal successors, (33379), 96 states have internal predecessors, (33379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:20:08,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:08,713 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:20:08,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 23:20:08,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 23:20:08,919 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:20:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1400047374, now seen corresponding path program 3 times [2022-01-18 23:20:08,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:08,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002767091] [2022-01-18 23:20:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:08,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 23:20:10,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:10,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002767091] [2022-01-18 23:20:10,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002767091] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:20:10,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103723463] [2022-01-18 23:20:10,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 23:20:10,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:20:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:20:10,647 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:20:10,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 23:20:11,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 23:20:11,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 23:20:11,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 91 conjunts are in the unsatisfiable core [2022-01-18 23:20:11,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:20:11,823 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-18 23:20:11,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 33 [2022-01-18 23:20:11,926 INFO L353 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-01-18 23:20:11,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 45 [2022-01-18 23:20:12,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-01-18 23:20:12,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:20:12,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:20:12,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:20:12,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-18 23:20:12,495 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-18 23:20:12,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-01-18 23:20:12,571 INFO L353 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-01-18 23:20:12,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-01-18 23:20:12,639 INFO L353 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-01-18 23:20:12,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-01-18 23:20:13,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:20:13,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:20:13,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:20:13,329 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:20:13,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-01-18 23:20:13,484 INFO L353 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-01-18 23:20:13,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2022-01-18 23:20:13,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-01-18 23:20:14,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-01-18 23:20:15,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-01-18 23:20:15,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:20:15,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:20:15,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 23:20:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-18 23:20:15,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:20:30,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int)) (|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2349 Int)) (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2347))) (store .cse0 |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2349))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:20:30,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int)) (|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2349 Int)) (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2347))) (store .cse0 |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2349))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:20:30,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int)) (|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2349 Int)) (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2347))) (store .cse0 |c_worker_fnThread1of1ForFork0_#t~mem20#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_#t~mem20#1.base|) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2349))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:20:30,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int)) (|worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| Int) (v_ArrVal_2349 Int)) (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2347)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) v_ArrVal_2349))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-01-18 23:20:30,685 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:20:30,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 294 [2022-01-18 23:20:30,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 314 [2022-01-18 23:20:31,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:20:31,265 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 67 treesize of output 69 [2022-01-18 23:20:31,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2346 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2346) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:20:31,541 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2346 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:20:31,547 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2345) |c_~#pre~0.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:20:31,565 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2345) |c_~#pre~0.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~#a~1#1.base|) |c_ULTIMATE.start_main_~#a~1#1.offset|) |c_~#in~0.base|))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:20:33,126 INFO L353 Elim1Store]: treesize reduction 118, result has 28.5 percent of original size [2022-01-18 23:20:33,127 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 3 case distinctions, treesize of input 49 treesize of output 69 [2022-01-18 23:20:33,147 INFO L353 Elim1Store]: treesize reduction 65, result has 26.1 percent of original size [2022-01-18 23:20:33,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 301 treesize of output 290 [2022-01-18 23:20:33,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 230 [2022-01-18 23:20:33,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 222 [2022-01-18 23:20:33,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 218 [2022-01-18 23:20:35,265 INFO L353 Elim1Store]: treesize reduction 54, result has 26.0 percent of original size [2022-01-18 23:20:35,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 48 [2022-01-18 23:20:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 5 not checked. [2022-01-18 23:20:35,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103723463] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:20:35,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:20:35,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 35] total 89 [2022-01-18 23:20:35,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743988591] [2022-01-18 23:20:35,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:20:35,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-01-18 23:20:35,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-01-18 23:20:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=5981, Unknown=60, NotChecked=1320, Total=7832 [2022-01-18 23:20:35,295 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 581 [2022-01-18 23:20:35,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 1407 transitions, 13500 flow. Second operand has 89 states, 89 states have (on average 352.69662921348316) internal successors, (31390), 89 states have internal predecessors, (31390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:20:35,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:35,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 581 [2022-01-18 23:20:35,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:22:20,151 INFO L129 PetriNetUnfolder]: 34751/115575 cut-off events. [2022-01-18 23:22:20,152 INFO L130 PetriNetUnfolder]: For 681026/682005 co-relation queries the response was YES. [2022-01-18 23:22:23,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397959 conditions, 115575 events. 34751/115575 cut-off events. For 681026/682005 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 1459308 event pairs, 11517 based on Foata normal form. 312/108756 useless extension candidates. Maximal degree in co-relation 397766. Up to 38203 conditions per place. [2022-01-18 23:22:24,322 INFO L132 encePairwiseOnDemand]: 511/581 looper letters, 2543 selfloop transitions, 1597 changer transitions 0/4519 dead transitions. [2022-01-18 23:22:24,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 4519 transitions, 60059 flow [2022-01-18 23:22:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-01-18 23:22:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2022-01-18 23:22:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 57430 transitions. [2022-01-18 23:22:24,350 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6216780870111173 [2022-01-18 23:22:24,350 INFO L72 ComplementDD]: Start complementDD. Operand 159 states and 57430 transitions. [2022-01-18 23:22:24,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 57430 transitions. [2022-01-18 23:22:24,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:22:24,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 159 states and 57430 transitions. [2022-01-18 23:22:24,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 160 states, 159 states have (on average 361.1949685534591) internal successors, (57430), 159 states have internal predecessors, (57430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:22:24,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 160 states, 160 states have (on average 581.0) internal successors, (92960), 160 states have internal predecessors, (92960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:22:24,613 INFO L81 ComplementDD]: Finished complementDD. Result has 160 states, 160 states have (on average 581.0) internal successors, (92960), 160 states have internal predecessors, (92960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:22:24,613 INFO L186 Difference]: Start difference. First operand has 871 places, 1407 transitions, 13500 flow. Second operand 159 states and 57430 transitions. [2022-01-18 23:22:24,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 4519 transitions, 60059 flow [2022-01-18 23:22:34,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 4519 transitions, 59196 flow, removed 384 selfloop flow, removed 17 redundant places. [2022-01-18 23:22:34,476 INFO L242 Difference]: Finished difference. Result has 1090 places, 3002 transitions, 43324 flow [2022-01-18 23:22:34,478 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=13130, PETRI_DIFFERENCE_MINUEND_PLACES=854, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=965, PETRI_DIFFERENCE_SUBTRAHEND_STATES=159, PETRI_FLOW=43324, PETRI_PLACES=1090, PETRI_TRANSITIONS=3002} [2022-01-18 23:22:34,478 INFO L334 CegarLoopForPetriNet]: 514 programPoint places, 576 predicate places. [2022-01-18 23:22:34,478 INFO L470 AbstractCegarLoop]: Abstraction has has 1090 places, 3002 transitions, 43324 flow [2022-01-18 23:22:34,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 352.69662921348316) internal successors, (31390), 89 states have internal predecessors, (31390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:22:34,482 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:22:34,482 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:22:34,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 23:22:34,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 23:22:34,683 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-18 23:22:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:22:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 226394444, now seen corresponding path program 4 times [2022-01-18 23:22:34,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:22:34,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795739127] [2022-01-18 23:22:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:22:34,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:22:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:22:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 23:22:36,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:22:36,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795739127] [2022-01-18 23:22:36,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795739127] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 23:22:36,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839412505] [2022-01-18 23:22:36,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 23:22:36,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 23:22:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:22:36,578 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 23:22:36,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 23:22:36,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 23:22:36,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 23:22:36,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-18 23:22:36,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 23:22:37,095 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 23:22:37,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 23:22:37,177 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-18 23:22:37,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-18 23:22:37,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 23:22:37,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:37,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:22:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:37,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-18 23:22:37,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:37,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:22:37,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:37,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-18 23:22:37,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:37,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-18 23:22:38,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:38,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:38,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:38,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:38,393 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-18 23:22:38,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:22:38,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:39,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:39,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 23:22:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:39,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 23:22:39,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 23:22:40,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 23:22:40,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-18 23:22:40,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 23:22:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 23:22:40,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 23:22:42,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) is different from false [2022-01-18 23:22:43,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) is different from false [2022-01-18 23:22:45,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) is different from false [2022-01-18 23:22:47,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| |c_worker_fnThread1of1ForFork0_#t~mem20#1.offset|))) is different from false [2022-01-18 23:22:49,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) is different from false [2022-01-18 23:22:49,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse0 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse0 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) is different from false [2022-01-18 23:22:49,634 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:22:49,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 164 [2022-01-18 23:22:49,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 166 [2022-01-18 23:22:49,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2022-01-18 23:22:49,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 23:22:49,964 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 49 treesize of output 51 [2022-01-18 23:22:50,490 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2556 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2556) |c_~#pre~0.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) 4))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:22:50,511 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2556 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2556) |c_~#pre~0.base| v_ArrVal_2559) |c_ULTIMATE.start_main_~#a~1#1.base|) |c_ULTIMATE.start_main_~#a~1#1.offset|) 4))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:23:16,366 INFO L353 Elim1Store]: treesize reduction 524, result has 10.9 percent of original size [2022-01-18 23:23:16,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 87 [2022-01-18 23:23:16,402 INFO L353 Elim1Store]: treesize reduction 215, result has 8.9 percent of original size [2022-01-18 23:23:16,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 611 treesize of output 572 [2022-01-18 23:23:16,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 499 [2022-01-18 23:23:16,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 483 [2022-01-18 23:23:16,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 483 treesize of output 475 [2022-01-18 23:23:27,730 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-01-18 23:23:27,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 28 [2022-01-18 23:23:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2022-01-18 23:23:27,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839412505] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 23:23:27,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 23:23:27,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 33] total 89 [2022-01-18 23:23:27,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994624572] [2022-01-18 23:23:27,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 23:23:27,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-01-18 23:23:27,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:23:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-01-18 23:23:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=6049, Unknown=97, NotChecked=1320, Total=7832 [2022-01-18 23:23:27,756 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 581 [2022-01-18 23:23:27,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1090 places, 3002 transitions, 43324 flow. Second operand has 89 states, 89 states have (on average 350.9550561797753) internal successors, (31235), 89 states have internal predecessors, (31235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 23:23:27,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:23:27,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 581 [2022-01-18 23:23:27,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:24:26,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|)) (.cse1 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) .cse1 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse1) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:27,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:30,584 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:31,399 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|) 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse0 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse0 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:24:31,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:33,461 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_~#in~0.base| 4) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:34,951 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (= |c_~#in~0.offset| 0) (= (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|) 0) (= |c_~#in~0.base| 4)) is different from false [2022-01-18 23:24:36,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:36,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|)) (.cse2 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) .cse2 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse2) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:37,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:37,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:37,170 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:37,663 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|)) (.cse2 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) .cse2 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse2) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:39,443 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|)) (.cse2 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (= |c_ULTIMATE.start_worker_fn_#t~mem18#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) .cse2 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse2) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:39,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (= |c_ULTIMATE.start_worker_fn_#t~mem18#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:39,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (= |c_ULTIMATE.start_worker_fn_#t~mem18#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:39,719 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|))) (and (= |c_ULTIMATE.start_worker_fn_#t~mem18#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:39,923 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#in~0.base|))) (let ((.cse0 (select .cse1 |c_~#in~0.offset|)) (.cse2 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse3 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (= |c_ULTIMATE.start_worker_fn_#t~mem18#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= (select .cse1 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) .cse2 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse2) (<= 4 |c_~#in~0.base|)))) is different from false [2022-01-18 23:24:40,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (<= (mod |c_ULTIMATE.start_worker_fn_#t~mem18#1| 256) 0) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:40,561 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (<= (mod |c_ULTIMATE.start_worker_fn_#t~mem18#1| 256) 0) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:40,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|)) (.cse1 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (<= (mod |c_ULTIMATE.start_worker_fn_#t~mem18#1| 256) 0) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) .cse1 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse1) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:40,876 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|)) (.cse1 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (<= (mod |c_ULTIMATE.start_worker_fn_#t~mem18#1| 256) 0) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) .cse1 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse1) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:41,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (= |c_worker_fnThread1of1ForFork0_#t~mem18#1| .cse0) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:42,040 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|)) (.cse1 (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse2 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (forall ((v_ArrVal_2559 (Array Int Int))) (< |c_~#in~0.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 4))) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) .cse1 (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (= |c_worker_fnThread1of1ForFork0_~i~0#1| 0) (or (not (<= (mod |c_worker_fnThread1of1ForFork0_#t~mem18#1| 256) 0)) .cse1) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:24:54,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_~#in~0.base|)) (< 0 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) 0)) (= |c_~#in~0.offset| 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (= .cse0 0) (not (= 3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_worker_fnThread1of1ForFork0_~a~0#1.base| |c_ULTIMATE.start_worker_fn_~arg#1.base|) (<= (mod |c_ULTIMATE.start_worker_fn_#t~mem18#1| 256) 0) (= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 0) (not (= |c_~#pre~0.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (= |c_~#in~0.base| 4) (= |c_~#pre~0.base| 3) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558))) (store .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select .cse1 |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561))) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2559) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (not (= |c_~#pre~0.base| |c_~#in~0.base|)) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:25:03,964 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#in~0.offset| 0) (= (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|) 0) (= |c_~#in~0.base| 4) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| |c_worker_fnThread1of1ForFork0_#t~mem20#1.offset|))) (not (= |c_worker_fnThread1of1ForFork0_#t~mem20#1.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:25:05,342 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (= |c_~#in~0.offset| 0) (<= 0 |c_worker_fnThread1of1ForFork0_#t~mem20#1.offset|) (= .cse0 0) (= |c_~#in~0.base| 4) (<= (mod .cse0 256) 0) (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (< |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| |c_worker_fnThread1of1ForFork0_#t~mem20#1.offset|))) (not (= |c_worker_fnThread1of1ForFork0_#t~mem20#1.base| |c_~#in~0.base|)) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:25:10,134 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) (not (= |c_~#in~0.base| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|)) (= |c_~#in~0.offset| 0) (= (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|) 0) (= |c_~#in~0.base| 4)) is different from false [2022-01-18 23:25:12,043 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#in~0.base|) |c_~#in~0.offset|))) (and (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int) (|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) (<= 0 |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset|) (not (= |c_~#in~0.base| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|)) (= |c_~#in~0.offset| 0) (= .cse0 0) (= |c_~#in~0.base| 4) (<= (mod .cse0 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:25:14,805 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#in~0.base| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|)) (= |c_~#in~0.offset| 0) (forall ((|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= |c_~#in~0.base| 4) (= (select (select |c_#memory_int| |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0)) is different from false [2022-01-18 23:25:16,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#in~0.base|))) (and (<= 0 |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset|) (not (= |c_~#in~0.base| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base|)) (= |c_~#in~0.offset| 0) (forall ((|v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| Int)) (or (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) (not (<= |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.offset| |v_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset_107|)))) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= |c_~#in~0.base| 4) (= (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0) (<= 4 |c_~#in~0.base|))) is different from false [2022-01-18 23:25:23,941 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) (= |c_~#in~0.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= |c_~#in~0.base| 4) (= (select (select |c_#memory_int| |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (not (= |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| |c_~#in~0.base|))) is different from false [2022-01-18 23:25:25,716 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#in~0.base|))) (and (forall ((|worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| Int) (v_ArrVal_2561 Int)) (<= (mod (select (select (store |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| (store (select |c_#memory_int| |worker_fnThread1of1ForFork0_barrier_wait_~b#1.base|) (+ |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset| 4) v_ArrVal_2561)) |c_~#in~0.base|) (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 256) 0)) (= |c_~#in~0.offset| 0) (= |c_ULTIMATE.start_worker_fn_~i~0#1| 0) (= |c_~#in~0.base| 4) (= (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~i~0#1| |c_~#in~0.offset|)) 0) (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0) (<= 0 |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.offset|) (not (= |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| |c_~#in~0.base|)) (<= 4 |c_~#in~0.base|))) is different from false Received shutdown request... [2022-01-18 23:25:36,385 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 23:25:36,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 23:25:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-18 23:25:37,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-01-18 23:25:39,985 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (33 of 34 remaining) [2022-01-18 23:25:39,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 23:25:39,985 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (32 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (31 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (30 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (29 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (28 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (27 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 34 remaining) [2022-01-18 23:25:39,987 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (25 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (24 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (23 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (22 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (21 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (20 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (18 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (16 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr4ASSERT_VIOLATIONERROR_FUNCTION (15 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr5ASSERT_VIOLATIONERROR_FUNCTION (14 of 34 remaining) [2022-01-18 23:25:39,988 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr8ASSERT_VIOLATIONERROR_FUNCTION (13 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr6ASSERT_VIOLATIONERROR_FUNCTION (12 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr9ASSERT_VIOLATIONERROR_FUNCTION (11 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr8ASSERT_VIOLATIONERROR_FUNCTION (3 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr6ASSERT_VIOLATIONERROR_FUNCTION (2 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 34 remaining) [2022-01-18 23:25:39,989 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location worker_fnErr7ASSERT_VIOLATIONERROR_FUNCTION (0 of 34 remaining) [2022-01-18 23:25:39,993 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 23:25:39,997 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 23:25:39,997 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 23:25:40,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 11:25:40 BasicIcfg [2022-01-18 23:25:40,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 23:25:40,003 INFO L158 Benchmark]: Toolchain (without parser) took 772658.15ms. Allocated memory was 331.4MB in the beginning and 14.1GB in the end (delta: 13.8GB). Free memory was 272.3MB in the beginning and 10.7GB in the end (delta: -10.5GB). Peak memory consumption was 3.7GB. Max. memory is 16.0GB. [2022-01-18 23:25:40,003 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 331.4MB. Free memory is still 290.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 23:25:40,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.00ms. Allocated memory is still 331.4MB. Free memory was 272.2MB in the beginning and 285.5MB in the end (delta: -13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2022-01-18 23:25:40,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.39ms. Allocated memory is still 331.4MB. Free memory was 285.5MB in the beginning and 281.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 23:25:40,005 INFO L158 Benchmark]: Boogie Preprocessor took 47.01ms. Allocated memory is still 331.4MB. Free memory was 281.3MB in the beginning and 277.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 23:25:40,005 INFO L158 Benchmark]: RCFGBuilder took 743.64ms. Allocated memory is still 331.4MB. Free memory was 277.8MB in the beginning and 240.8MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2022-01-18 23:25:40,009 INFO L158 Benchmark]: TraceAbstraction took 771260.76ms. Allocated memory was 331.4MB in the beginning and 14.1GB in the end (delta: 13.8GB). Free memory was 240.0MB in the beginning and 10.7GB in the end (delta: -10.5GB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. [2022-01-18 23:25:40,011 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.15ms. Allocated memory is still 331.4MB. Free memory is still 290.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 535.00ms. Allocated memory is still 331.4MB. Free memory was 272.2MB in the beginning and 285.5MB in the end (delta: -13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.39ms. Allocated memory is still 331.4MB. Free memory was 285.5MB in the beginning and 281.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.01ms. Allocated memory is still 331.4MB. Free memory was 281.3MB in the beginning and 277.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 743.64ms. Allocated memory is still 331.4MB. Free memory was 277.8MB in the beginning and 240.8MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 771260.76ms. Allocated memory was 331.4MB in the beginning and 14.1GB in the end (delta: 13.8GB). Free memory was 240.0MB in the beginning and 10.7GB in the end (delta: -10.5GB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 755]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 756]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 765]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 772]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 781]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 773]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 804]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 801]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 795]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 755]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 756]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 765]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 768]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 776]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 772]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 781]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 773]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 713 locations, 34 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 771.0s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 359.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13520 SdHoareTripleChecker+Valid, 25.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13520 mSDsluCounter, 40023 SdHoareTripleChecker+Invalid, 20.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 67467 IncrementalHoareTripleChecker+Unchecked, 37988 mSDsCounter, 1903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45318 IncrementalHoareTripleChecker+Invalid, 114688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1903 mSolverCounterUnsat, 2321 mSDtfsCounter, 45318 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3849 GetRequests, 2379 SyntacticMatches, 184 SemanticMatches, 1286 ConstructedPredicates, 82 IntricatePredicates, 15 DeprecatedPredicates, 60689 ImplicationChecksByTransitivity, 277.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43324occurred in iteration=17, InterpolantAutomatonStates: 539, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 404.0s InterpolantComputationTime, 3024 NumberOfCodeBlocks, 3024 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4239 ConstructedInterpolants, 1041 QuantifiedInterpolants, 121357 SizeOfPredicates, 248 NumberOfNonLiveVariables, 4849 ConjunctsInSsa, 712 ConjunctsInUnsatCore, 43 InterpolantComputations, 6 PerfectInterpolantSequences, 262/589 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