/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:23:04,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:23:04,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:23:04,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:23:04,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:23:04,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:23:04,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:23:04,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:23:04,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:23:04,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:23:04,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:23:04,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:23:04,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:23:04,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:23:04,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:23:04,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:23:04,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:23:04,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:23:04,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:23:04,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:23:04,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:23:04,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:23:04,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:23:04,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:23:04,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:23:04,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:23:04,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:23:04,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:23:04,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:23:04,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:23:04,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:23:04,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:23:04,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:23:04,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:23:04,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:23:04,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:23:04,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:23:04,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:23:04,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:23:04,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:23:04,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:23:04,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:23:04,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:23:04,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:23:04,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:23:04,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:23:04,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:23:04,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:23:04,912 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:23:04,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:23:04,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:23:04,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:23:04,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:23:04,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:23:04,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:23:04,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:23:04,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:23:04,915 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:23:04,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:23:04,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:23:04,915 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 17:23:05,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:23:05,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:23:05,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:23:05,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:23:05,114 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:23:05,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-03-15 17:23:05,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1f17707/9bf414682fc44ff087089ed91d45aea4/FLAGf4e1e1f98 [2022-03-15 17:23:05,517 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:23:05,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-03-15 17:23:05,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1f17707/9bf414682fc44ff087089ed91d45aea4/FLAGf4e1e1f98 [2022-03-15 17:23:05,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1f17707/9bf414682fc44ff087089ed91d45aea4 [2022-03-15 17:23:05,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:23:05,883 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:23:05,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:23:05,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:23:05,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:23:05,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:23:05" (1/1) ... [2022-03-15 17:23:05,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f69799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:05, skipping insertion in model container [2022-03-15 17:23:05,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:23:05" (1/1) ... [2022-03-15 17:23:05,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:23:05,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:23:06,284 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/queue_ok.i[43266,43279] [2022-03-15 17:23:06,290 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/queue_ok.i[43543,43556] [2022-03-15 17:23:06,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:23:06,301 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:23:06,331 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/queue_ok.i[43266,43279] [2022-03-15 17:23:06,333 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/queue_ok.i[43543,43556] [2022-03-15 17:23:06,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:23:06,381 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:23:06,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06 WrapperNode [2022-03-15 17:23:06,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:23:06,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:23:06,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:23:06,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:23:06,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,447 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-03-15 17:23:06,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:23:06,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:23:06,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:23:06,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:23:06,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:23:06,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:23:06,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:23:06,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:23:06,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (1/1) ... [2022-03-15 17:23:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:23:06,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:06,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:23:06,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:23:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 17:23:06,552 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 17:23:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 17:23:06,552 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 17:23:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:23:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:23:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 17:23:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:23:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 17:23:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:23:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:23:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:23:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:23:06,560 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:23:06,673 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:23:06,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:23:06,974 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:23:06,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:23:06,980 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 17:23:06,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:23:06 BoogieIcfgContainer [2022-03-15 17:23:06,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:23:06,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:23:06,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:23:06,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:23:06,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:23:05" (1/3) ... [2022-03-15 17:23:06,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd367f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:23:06, skipping insertion in model container [2022-03-15 17:23:06,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:23:06" (2/3) ... [2022-03-15 17:23:06,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd367f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:23:06, skipping insertion in model container [2022-03-15 17:23:06,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:23:06" (3/3) ... [2022-03-15 17:23:06,987 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-03-15 17:23:06,995 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:23:06,995 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:23:06,996 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:23:06,996 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:23:07,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,046 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,047 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,048 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,049 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,050 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,051 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,052 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,053 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,054 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,055 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,056 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,057 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,057 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,058 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,059 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,060 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,061 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,062 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,063 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,064 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,065 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,066 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,067 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,068 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,068 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,068 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,068 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,069 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,070 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,071 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,072 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,073 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,074 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,075 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,081 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,082 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,083 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,084 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,085 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,086 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,087 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,088 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,089 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,090 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,095 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,096 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,097 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,098 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,099 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,100 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,101 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,102 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,104 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,105 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,111 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,112 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,113 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,114 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:23:07,116 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 17:23:07,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:23:07,154 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:23:07,154 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 17:23:07,166 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:23:07,172 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 231 transitions, 478 flow [2022-03-15 17:23:07,174 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 231 transitions, 478 flow [2022-03-15 17:23:07,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-03-15 17:23:07,226 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-03-15 17:23:07,226 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 17:23:07,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-03-15 17:23:07,239 INFO L116 LiptonReduction]: Number of co-enabled transitions 10630 [2022-03-15 17:23:13,438 INFO L131 LiptonReduction]: Checked pairs total: 22451 [2022-03-15 17:23:13,438 INFO L133 LiptonReduction]: Total number of compositions: 215 [2022-03-15 17:23:13,444 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2022-03-15 17:23:13,489 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 17:23:13,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:13,501 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 17:23:13,502 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 904, now seen corresponding path program 1 times [2022-03-15 17:23:13,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:13,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417337694] [2022-03-15 17:23:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:13,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:13,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417337694] [2022-03-15 17:23:13,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417337694] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:23:13,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:23:13,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 17:23:13,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333283664] [2022-03-15 17:23:13,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:13,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:13,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 17:23:13,615 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:13,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:13,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 17:23:13,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 17:23:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 17:23:13,642 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:13,721 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2022-03-15 17:23:13,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 17:23:13,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-03-15 17:23:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:13,738 INFO L225 Difference]: With dead ends: 510 [2022-03-15 17:23:13,738 INFO L226 Difference]: Without dead ends: 510 [2022-03-15 17:23:13,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 17:23:13,742 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:13,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:23:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-03-15 17:23:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-03-15 17:23:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2022-03-15 17:23:13,807 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2022-03-15 17:23:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:13,807 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2022-03-15 17:23:13,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2022-03-15 17:23:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:23:13,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:13,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:13,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:23:13,813 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1487211735, now seen corresponding path program 1 times [2022-03-15 17:23:13,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:13,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353132784] [2022-03-15 17:23:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:13,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:13,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353132784] [2022-03-15 17:23:13,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353132784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:23:13,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:23:13,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:23:13,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793280756] [2022-03-15 17:23:13,951 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:13,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:13,956 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 17:23:13,956 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:13,956 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:13,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:23:13,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:13,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:23:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:23:13,957 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:14,006 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2022-03-15 17:23:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:23:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 17:23:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:14,007 INFO L225 Difference]: With dead ends: 220 [2022-03-15 17:23:14,007 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 17:23:14,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:23:14,008 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:14,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:23:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 17:23:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-03-15 17:23:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2022-03-15 17:23:14,015 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2022-03-15 17:23:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:14,016 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2022-03-15 17:23:14,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2022-03-15 17:23:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:23:14,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:14,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:14,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:23:14,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1793331440, now seen corresponding path program 1 times [2022-03-15 17:23:14,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:14,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727627179] [2022-03-15 17:23:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:14,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:14,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727627179] [2022-03-15 17:23:14,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727627179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:23:14,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:23:14,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:23:14,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667279959] [2022-03-15 17:23:14,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:14,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:14,073 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 41 transitions. [2022-03-15 17:23:14,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:14,138 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3404#(< |t1Thread1of1ForFork0_~i~0#1| 20)] [2022-03-15 17:23:14,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:23:14,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:23:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:23:14,139 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:14,217 INFO L93 Difference]: Finished difference Result 264 states and 572 transitions. [2022-03-15 17:23:14,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:23:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 17:23:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:14,218 INFO L225 Difference]: With dead ends: 264 [2022-03-15 17:23:14,218 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 17:23:14,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:23:14,220 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:14,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 17:23:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-03-15 17:23:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.1749049429657794) internal successors, (572), 263 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 572 transitions. [2022-03-15 17:23:14,240 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 572 transitions. Word has length 19 [2022-03-15 17:23:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:14,240 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 572 transitions. [2022-03-15 17:23:14,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 572 transitions. [2022-03-15 17:23:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 17:23:14,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:14,241 INFO L514 BasicCegarLoop]: 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] [2022-03-15 17:23:14,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:23:14,241 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -170073012, now seen corresponding path program 1 times [2022-03-15 17:23:14,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:14,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424036254] [2022-03-15 17:23:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:23:14,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:14,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424036254] [2022-03-15 17:23:14,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424036254] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:23:14,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:23:14,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:23:14,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132177279] [2022-03-15 17:23:14,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:14,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:14,329 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 93 transitions. [2022-03-15 17:23:14,329 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:14,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4201#(not (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0))] [2022-03-15 17:23:14,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:23:14,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:23:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:23:14,524 INFO L87 Difference]: Start difference. First operand 264 states and 572 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:14,581 INFO L93 Difference]: Finished difference Result 192 states and 378 transitions. [2022-03-15 17:23:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:23:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 17:23:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:14,582 INFO L225 Difference]: With dead ends: 192 [2022-03-15 17:23:14,582 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 17:23:14,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:23:14,583 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:14,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 3 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:23:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 17:23:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-03-15 17:23:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.9841269841269842) internal successors, (375), 189 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 375 transitions. [2022-03-15 17:23:14,586 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 375 transitions. Word has length 33 [2022-03-15 17:23:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:14,587 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 375 transitions. [2022-03-15 17:23:14,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 375 transitions. [2022-03-15 17:23:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 17:23:14,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:14,587 INFO L514 BasicCegarLoop]: 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] [2022-03-15 17:23:14,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:23:14,588 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 856756354, now seen corresponding path program 1 times [2022-03-15 17:23:14,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:14,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575998492] [2022-03-15 17:23:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:14,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:14,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575998492] [2022-03-15 17:23:14,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575998492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:14,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127454916] [2022-03-15 17:23:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:14,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:14,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 17:23:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:14,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 17:23:14,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:14,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:14,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127454916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:14,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:14,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 17:23:14,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063361232] [2022-03-15 17:23:14,928 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:14,934 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:14,948 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 66 transitions. [2022-03-15 17:23:14,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:15,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:15,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:23:15,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:23:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:23:15,041 INFO L87 Difference]: Start difference. First operand 190 states and 375 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:15,116 INFO L93 Difference]: Finished difference Result 266 states and 516 transitions. [2022-03-15 17:23:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:23:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 17:23:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:15,126 INFO L225 Difference]: With dead ends: 266 [2022-03-15 17:23:15,126 INFO L226 Difference]: Without dead ends: 266 [2022-03-15 17:23:15,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:23:15,126 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:15,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 10 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-03-15 17:23:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2022-03-15 17:23:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.960698689956332) internal successors, (449), 229 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 449 transitions. [2022-03-15 17:23:15,134 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 449 transitions. Word has length 34 [2022-03-15 17:23:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:15,135 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 449 transitions. [2022-03-15 17:23:15,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 449 transitions. [2022-03-15 17:23:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 17:23:15,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:15,137 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:15,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 17:23:15,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:15,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1991280424, now seen corresponding path program 2 times [2022-03-15 17:23:15,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:15,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134844270] [2022-03-15 17:23:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:15,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134844270] [2022-03-15 17:23:15,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134844270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817096733] [2022-03-15 17:23:15,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:23:15,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:15,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 17:23:15,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:23:15,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:23:15,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 17:23:15,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:15,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:15,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817096733] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:15,723 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:15,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-03-15 17:23:15,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184220433] [2022-03-15 17:23:15,723 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:15,731 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:15,755 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 87 transitions. [2022-03-15 17:23:15,755 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:15,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:15,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:23:15,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:15,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:23:15,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:23:15,888 INFO L87 Difference]: Start difference. First operand 230 states and 449 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:15,986 INFO L93 Difference]: Finished difference Result 306 states and 590 transitions. [2022-03-15 17:23:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:23:15,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 17:23:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:15,988 INFO L225 Difference]: With dead ends: 306 [2022-03-15 17:23:15,988 INFO L226 Difference]: Without dead ends: 306 [2022-03-15 17:23:15,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:23:15,988 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:15,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 14 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-03-15 17:23:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2022-03-15 17:23:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2022-03-15 17:23:15,993 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 41 [2022-03-15 17:23:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2022-03-15 17:23:15,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2022-03-15 17:23:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 17:23:15,994 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:15,994 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:16,013 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-03-15 17:23:16,203 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,SelfDestructingSolverStorable5 [2022-03-15 17:23:16,204 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1322179646, now seen corresponding path program 3 times [2022-03-15 17:23:16,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:16,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729695734] [2022-03-15 17:23:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:16,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:16,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729695734] [2022-03-15 17:23:16,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729695734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:16,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638591426] [2022-03-15 17:23:16,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:23:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:16,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:16,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 17:23:16,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:23:16,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:23:16,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 17:23:16,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:17,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:23:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:23:17,145 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-03-15 17:23:17,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:23:17,197 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:23:17,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:23:17,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:23:17,234 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-03-15 17:23:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:23:17,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:19,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int) (v_ArrVal_488 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_489) .cse1) 20)))) is different from false [2022-03-15 17:23:19,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:19,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:23:20,000 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:20,001 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 78 treesize of output 80 [2022-03-15 17:23:20,007 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 63 treesize of output 55 [2022-03-15 17:23:20,140 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 8 treesize of output 4 [2022-03-15 17:23:20,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:20,197 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 77 treesize of output 77 [2022-03-15 17:23:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-03-15 17:23:20,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638591426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:20,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:20,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 17:23:20,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836290243] [2022-03-15 17:23:20,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:20,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:20,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 108 transitions. [2022-03-15 17:23:20,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:20,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:20,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:23:20,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:23:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=6, NotChecked=32, Total=342 [2022-03-15 17:23:20,514 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:20,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:20,610 INFO L93 Difference]: Finished difference Result 346 states and 664 transitions. [2022-03-15 17:23:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:23:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-03-15 17:23:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:20,612 INFO L225 Difference]: With dead ends: 346 [2022-03-15 17:23:20,612 INFO L226 Difference]: Without dead ends: 346 [2022-03-15 17:23:20,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=64, Invalid=240, Unknown=6, NotChecked=32, Total=342 [2022-03-15 17:23:20,613 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:20,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 15 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-03-15 17:23:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2022-03-15 17:23:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.9320388349514563) internal successors, (597), 309 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 597 transitions. [2022-03-15 17:23:20,618 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 597 transitions. Word has length 48 [2022-03-15 17:23:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:20,618 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 597 transitions. [2022-03-15 17:23:20,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 597 transitions. [2022-03-15 17:23:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-15 17:23:20,619 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:20,619 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:20,639 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-03-15 17:23:20,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:20,831 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1781580392, now seen corresponding path program 4 times [2022-03-15 17:23:20,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:20,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796354980] [2022-03-15 17:23:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:20,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:20,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796354980] [2022-03-15 17:23:20,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796354980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:20,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206958060] [2022-03-15 17:23:20,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:23:20,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:20,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:20,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 17:23:21,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:23:21,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:23:21,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 17:23:21,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:21,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:21,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206958060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:21,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:21,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-03-15 17:23:21,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122352150] [2022-03-15 17:23:21,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:21,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:21,412 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 129 transitions. [2022-03-15 17:23:21,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:21,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:21,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:23:21,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:23:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:23:21,573 INFO L87 Difference]: Start difference. First operand 310 states and 597 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:21,675 INFO L93 Difference]: Finished difference Result 386 states and 738 transitions. [2022-03-15 17:23:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:23:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-03-15 17:23:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:21,677 INFO L225 Difference]: With dead ends: 386 [2022-03-15 17:23:21,677 INFO L226 Difference]: Without dead ends: 386 [2022-03-15 17:23:21,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:23:21,677 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 110 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:21,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 13 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-03-15 17:23:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 350. [2022-03-15 17:23:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.9226361031518624) internal successors, (671), 349 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 671 transitions. [2022-03-15 17:23:21,685 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 671 transitions. Word has length 55 [2022-03-15 17:23:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:21,686 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 671 transitions. [2022-03-15 17:23:21,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 671 transitions. [2022-03-15 17:23:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-15 17:23:21,687 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:21,687 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:21,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 17:23:21,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:21,903 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1223784702, now seen corresponding path program 5 times [2022-03-15 17:23:21,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:21,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526646133] [2022-03-15 17:23:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:22,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:22,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526646133] [2022-03-15 17:23:22,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526646133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:22,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216834765] [2022-03-15 17:23:22,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:23:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:22,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 17:23:22,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 17:23:22,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:23:22,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 17:23:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:22,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:23:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-03-15 17:23:22,291 INFO L353 Elim1Store]: treesize reduction 27, result has 46.0 percent of original size [2022-03-15 17:23:22,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 39 [2022-03-15 17:23:22,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:23:22,383 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-03-15 17:23:22,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2022-03-15 17:23:22,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:23:22,454 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 37 treesize of output 36 [2022-03-15 17:23:22,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 13 [2022-03-15 17:23:22,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:23:22,533 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 32 treesize of output 31 [2022-03-15 17:23:22,569 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:23:22,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 27 [2022-03-15 17:23:22,590 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 17:23:22,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-03-15 17:23:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-15 17:23:22,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:26,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_832 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_830)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_832) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:23:53,095 INFO L353 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2022-03-15 17:23:53,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 272 treesize of output 286 [2022-03-15 17:23:53,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:53,143 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 44 treesize of output 46 [2022-03-15 17:23:53,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:23:53,183 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 7 treesize of output 3 [2022-03-15 17:23:53,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:23:53,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:23:53,230 INFO L353 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2022-03-15 17:23:53,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 379 treesize of output 384 [2022-03-15 17:23:53,542 INFO L353 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2022-03-15 17:23:53,543 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 487 treesize of output 473 [2022-03-15 17:23:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 1 not checked. [2022-03-15 17:23:53,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216834765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:53,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:53,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 30 [2022-03-15 17:23:53,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192033257] [2022-03-15 17:23:53,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:53,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:53,962 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 150 transitions. [2022-03-15 17:23:53,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:54,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:54,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:23:54,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:23:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=640, Unknown=19, NotChecked=54, Total=870 [2022-03-15 17:23:54,150 INFO L87 Difference]: Start difference. First operand 350 states and 671 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:54,274 INFO L93 Difference]: Finished difference Result 426 states and 812 transitions. [2022-03-15 17:23:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:23:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-03-15 17:23:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:54,276 INFO L225 Difference]: With dead ends: 426 [2022-03-15 17:23:54,276 INFO L226 Difference]: Without dead ends: 426 [2022-03-15 17:23:54,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=157, Invalid=640, Unknown=19, NotChecked=54, Total=870 [2022-03-15 17:23:54,277 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 123 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:54,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 17 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-03-15 17:23:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 390. [2022-03-15 17:23:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.9151670951156812) internal successors, (745), 389 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 745 transitions. [2022-03-15 17:23:54,283 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 745 transitions. Word has length 62 [2022-03-15 17:23:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:54,283 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 745 transitions. [2022-03-15 17:23:54,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 745 transitions. [2022-03-15 17:23:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-15 17:23:54,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:54,284 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:54,300 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-03-15 17:23:54,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:54,495 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1174949288, now seen corresponding path program 6 times [2022-03-15 17:23:54,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:54,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274831551] [2022-03-15 17:23:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:54,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:54,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274831551] [2022-03-15 17:23:54,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274831551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:54,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495003227] [2022-03-15 17:23:54,651 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:23:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:54,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:23:54,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 17:23:55,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 17:23:55,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:23:55,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 17:23:55,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:23:55,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:23:55,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:23:55,267 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-03-15 17:23:55,324 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:23:55,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 17:23:55,350 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 17:23:55,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-03-15 17:23:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 64 proven. 5 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-03-15 17:23:55,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:23:58,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1026 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1024) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1026) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:23:58,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:58,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:23:58,583 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:58,583 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 78 treesize of output 80 [2022-03-15 17:23:58,587 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 63 treesize of output 55 [2022-03-15 17:23:58,593 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 8 treesize of output 4 [2022-03-15 17:23:58,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:23:58,611 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 72 treesize of output 72 [2022-03-15 17:23:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 64 proven. 5 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-03-15 17:23:58,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495003227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:23:58,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:23:58,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-03-15 17:23:58,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937863076] [2022-03-15 17:23:58,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:23:58,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:23:58,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 121 states and 171 transitions. [2022-03-15 17:23:58,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:23:59,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:23:59,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 17:23:59,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:23:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 17:23:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=334, Unknown=6, NotChecked=38, Total=462 [2022-03-15 17:23:59,279 INFO L87 Difference]: Start difference. First operand 390 states and 745 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:23:59,416 INFO L93 Difference]: Finished difference Result 466 states and 886 transitions. [2022-03-15 17:23:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 17:23:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-03-15 17:23:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:23:59,419 INFO L225 Difference]: With dead ends: 466 [2022-03-15 17:23:59,419 INFO L226 Difference]: Without dead ends: 466 [2022-03-15 17:23:59,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=84, Invalid=334, Unknown=6, NotChecked=38, Total=462 [2022-03-15 17:23:59,419 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 161 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:23:59,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 15 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:23:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-03-15 17:23:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 430. [2022-03-15 17:23:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.9090909090909092) internal successors, (819), 429 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 819 transitions. [2022-03-15 17:23:59,426 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 819 transitions. Word has length 69 [2022-03-15 17:23:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:23:59,426 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 819 transitions. [2022-03-15 17:23:59,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:23:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 819 transitions. [2022-03-15 17:23:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-15 17:23:59,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:23:59,427 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:23:59,451 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-03-15 17:23:59,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:59,650 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:23:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:23:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 119355970, now seen corresponding path program 7 times [2022-03-15 17:23:59,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:23:59,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108888275] [2022-03-15 17:23:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:23:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:23:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:23:59,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:23:59,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108888275] [2022-03-15 17:23:59,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108888275] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:23:59,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163137033] [2022-03-15 17:23:59,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:23:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:23:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:23:59,762 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-03-15 17:23:59,763 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-03-15 17:23:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:23:59,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:23:59,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:00,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:00,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163137033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:00,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:00,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-03-15 17:24:00,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1945997708] [2022-03-15 17:24:00,267 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:00,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:00,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 192 transitions. [2022-03-15 17:24:00,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:00,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:00,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:24:00,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:00,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:24:00,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:24:00,887 INFO L87 Difference]: Start difference. First operand 430 states and 819 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:01,089 INFO L93 Difference]: Finished difference Result 506 states and 960 transitions. [2022-03-15 17:24:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 17:24:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-03-15 17:24:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:01,091 INFO L225 Difference]: With dead ends: 506 [2022-03-15 17:24:01,091 INFO L226 Difference]: Without dead ends: 506 [2022-03-15 17:24:01,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:24:01,092 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 138 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:01,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 22 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-03-15 17:24:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 470. [2022-03-15 17:24:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.904051172707889) internal successors, (893), 469 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 893 transitions. [2022-03-15 17:24:01,098 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 893 transitions. Word has length 76 [2022-03-15 17:24:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:01,098 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 893 transitions. [2022-03-15 17:24:01,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 893 transitions. [2022-03-15 17:24:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-15 17:24:01,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:01,101 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:01,119 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-03-15 17:24:01,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:01,317 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1221908248, now seen corresponding path program 8 times [2022-03-15 17:24:01,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:01,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771419468] [2022-03-15 17:24:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:01,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:01,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771419468] [2022-03-15 17:24:01,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771419468] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:01,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147395826] [2022-03-15 17:24:01,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:24:01,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:01,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:01,433 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-03-15 17:24:01,434 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-03-15 17:24:01,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:24:01,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:01,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 17:24:01,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:01,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:02,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147395826] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:02,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:02,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-03-15 17:24:02,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406254706] [2022-03-15 17:24:02,003 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:02,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:02,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 213 transitions. [2022-03-15 17:24:02,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:02,802 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:02,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 17:24:02,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 17:24:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:02,803 INFO L87 Difference]: Start difference. First operand 470 states and 893 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:02,959 INFO L93 Difference]: Finished difference Result 546 states and 1034 transitions. [2022-03-15 17:24:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 17:24:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-03-15 17:24:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:02,961 INFO L225 Difference]: With dead ends: 546 [2022-03-15 17:24:02,961 INFO L226 Difference]: Without dead ends: 546 [2022-03-15 17:24:02,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:02,962 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 182 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:02,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 23 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:24:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-03-15 17:24:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 510. [2022-03-15 17:24:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.899803536345776) internal successors, (967), 509 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 967 transitions. [2022-03-15 17:24:02,969 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 967 transitions. Word has length 83 [2022-03-15 17:24:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:02,969 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 967 transitions. [2022-03-15 17:24:02,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 967 transitions. [2022-03-15 17:24:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 17:24:02,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:02,970 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:02,988 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-03-15 17:24:03,184 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,SelfDestructingSolverStorable11 [2022-03-15 17:24:03,184 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 147930498, now seen corresponding path program 9 times [2022-03-15 17:24:03,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:03,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614345572] [2022-03-15 17:24:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:03,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:03,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614345572] [2022-03-15 17:24:03,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614345572] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:03,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69484333] [2022-03-15 17:24:03,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:24:03,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:03,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:03,314 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-03-15 17:24:03,314 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-03-15 17:24:03,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:24:03,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:03,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 17:24:03,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:04,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:24:04,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:04,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 16 treesize of output 18 [2022-03-15 17:24:04,228 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:24:04,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 17:24:04,262 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 17:24:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-15 17:24:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-03-15 17:24:04,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:07,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_197| Int) (v_ArrVal_1685 (Array Int Int)) (v_ArrVal_1687 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1685) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_197| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_197| 4) |c_~#queue~0.offset|) v_ArrVal_1687) .cse1) 20)))) is different from false [2022-03-15 17:24:07,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:07,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:24:07,150 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:07,151 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 78 treesize of output 80 [2022-03-15 17:24:07,161 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 63 treesize of output 55 [2022-03-15 17:24:07,165 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 8 treesize of output 4 [2022-03-15 17:24:07,281 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:07,282 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 80 treesize of output 80 [2022-03-15 17:24:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 8 not checked. [2022-03-15 17:24:07,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69484333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:07,459 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:07,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-03-15 17:24:07,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1814284784] [2022-03-15 17:24:07,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:07,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:07,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 163 states and 234 transitions. [2022-03-15 17:24:07,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:08,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:08,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 17:24:08,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 17:24:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=433, Unknown=6, NotChecked=44, Total=600 [2022-03-15 17:24:08,257 INFO L87 Difference]: Start difference. First operand 510 states and 967 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:08,427 INFO L93 Difference]: Finished difference Result 586 states and 1108 transitions. [2022-03-15 17:24:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 17:24:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-03-15 17:24:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:08,429 INFO L225 Difference]: With dead ends: 586 [2022-03-15 17:24:08,429 INFO L226 Difference]: Without dead ends: 586 [2022-03-15 17:24:08,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=117, Invalid=433, Unknown=6, NotChecked=44, Total=600 [2022-03-15 17:24:08,430 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 190 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:08,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 21 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-03-15 17:24:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 550. [2022-03-15 17:24:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.8961748633879782) internal successors, (1041), 549 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1041 transitions. [2022-03-15 17:24:08,445 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1041 transitions. Word has length 90 [2022-03-15 17:24:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:08,445 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1041 transitions. [2022-03-15 17:24:08,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1041 transitions. [2022-03-15 17:24:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-15 17:24:08,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:08,450 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:08,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 17:24:08,650 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,SelfDestructingSolverStorable12 [2022-03-15 17:24:08,651 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1349692376, now seen corresponding path program 10 times [2022-03-15 17:24:08,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:08,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638326607] [2022-03-15 17:24:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:08,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:08,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638326607] [2022-03-15 17:24:08,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638326607] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:08,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794610873] [2022-03-15 17:24:08,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:24:08,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:08,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-03-15 17:24:08,871 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-03-15 17:24:14,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:24:14,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:14,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 17:24:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:14,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:14,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794610873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:14,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:14,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2022-03-15 17:24:14,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784113261] [2022-03-15 17:24:14,399 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:14,481 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:14,761 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 255 transitions. [2022-03-15 17:24:14,761 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:15,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:15,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 17:24:15,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 17:24:15,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:15,212 INFO L87 Difference]: Start difference. First operand 550 states and 1041 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:15,427 INFO L93 Difference]: Finished difference Result 626 states and 1182 transitions. [2022-03-15 17:24:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 17:24:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-03-15 17:24:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:15,429 INFO L225 Difference]: With dead ends: 626 [2022-03-15 17:24:15,429 INFO L226 Difference]: Without dead ends: 626 [2022-03-15 17:24:15,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:15,430 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 186 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:15,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 28 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-03-15 17:24:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 590. [2022-03-15 17:24:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.8930390492359932) internal successors, (1115), 589 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1115 transitions. [2022-03-15 17:24:15,446 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1115 transitions. Word has length 97 [2022-03-15 17:24:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:15,446 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 1115 transitions. [2022-03-15 17:24:15,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1115 transitions. [2022-03-15 17:24:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-15 17:24:15,448 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:15,448 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:15,472 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-03-15 17:24:15,659 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,SelfDestructingSolverStorable13 [2022-03-15 17:24:15,660 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 144609474, now seen corresponding path program 11 times [2022-03-15 17:24:15,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:15,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431624215] [2022-03-15 17:24:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:15,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:15,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431624215] [2022-03-15 17:24:15,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431624215] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:15,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672746398] [2022-03-15 17:24:15,837 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:24:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:15,838 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-03-15 17:24:15,839 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-03-15 17:24:16,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 17:24:16,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:16,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 17:24:16,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:16,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:24:16,155 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-03-15 17:24:16,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 38 [2022-03-15 17:24:16,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:24:16,280 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-03-15 17:24:16,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 63 [2022-03-15 17:24:16,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:16,369 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 49 treesize of output 48 [2022-03-15 17:24:16,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 13 [2022-03-15 17:24:16,495 INFO L353 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-03-15 17:24:16,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 31 [2022-03-15 17:24:16,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:24:16,545 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:24:16,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 17:24:16,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:16,570 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-03-15 17:24:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 289 proven. 8 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-03-15 17:24:16,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:20,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2217 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2217)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2219) .cse1) 20)))) is different from false [2022-03-15 17:24:33,169 INFO L353 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2022-03-15 17:24:33,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2022-03-15 17:24:33,175 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:33,175 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 73 treesize of output 73 [2022-03-15 17:24:33,183 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 51 treesize of output 43 [2022-03-15 17:24:33,216 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:33,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2022-03-15 17:24:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 287 proven. 9 refuted. 0 times theorem prover too weak. 177 trivial. 1 not checked. [2022-03-15 17:24:33,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672746398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:33,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:33,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 33 [2022-03-15 17:24:33,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067703367] [2022-03-15 17:24:33,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:33,330 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:33,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 276 transitions. [2022-03-15 17:24:33,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:34,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:34,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 17:24:34,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 17:24:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=789, Unknown=15, NotChecked=60, Total=1056 [2022-03-15 17:24:34,207 INFO L87 Difference]: Start difference. First operand 590 states and 1115 transitions. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:34,416 INFO L93 Difference]: Finished difference Result 666 states and 1256 transitions. [2022-03-15 17:24:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 17:24:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-03-15 17:24:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:34,419 INFO L225 Difference]: With dead ends: 666 [2022-03-15 17:24:34,419 INFO L226 Difference]: Without dead ends: 666 [2022-03-15 17:24:34,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 273 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=192, Invalid=789, Unknown=15, NotChecked=60, Total=1056 [2022-03-15 17:24:34,420 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 224 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:34,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 26 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-03-15 17:24:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 630. [2022-03-15 17:24:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.890302066772655) internal successors, (1189), 629 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1189 transitions. [2022-03-15 17:24:34,432 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1189 transitions. Word has length 104 [2022-03-15 17:24:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:34,432 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 1189 transitions. [2022-03-15 17:24:34,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1189 transitions. [2022-03-15 17:24:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-15 17:24:34,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:34,435 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:34,455 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-03-15 17:24:34,653 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,SelfDestructingSolverStorable14 [2022-03-15 17:24:34,653 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1507668120, now seen corresponding path program 12 times [2022-03-15 17:24:34,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:34,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031698781] [2022-03-15 17:24:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:34,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:34,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031698781] [2022-03-15 17:24:34,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031698781] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:34,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669079046] [2022-03-15 17:24:34,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:24:34,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:34,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:34,818 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-03-15 17:24:34,819 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-03-15 17:24:36,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 17:24:36,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:36,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 17:24:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:36,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:24:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:36,498 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-03-15 17:24:36,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:24:36,553 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:24:36,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:24:36,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:36,587 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-03-15 17:24:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 256 proven. 15 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-03-15 17:24:36,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:38,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_341| Int) (v_ArrVal_2509 Int) (v_ArrVal_2507 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_341| 4) |c_~#queue~0.offset|) v_ArrVal_2509) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_341| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:24:38,970 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:38,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:24:38,976 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:38,977 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 78 treesize of output 80 [2022-03-15 17:24:38,981 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 63 treesize of output 55 [2022-03-15 17:24:39,109 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 8 treesize of output 4 [2022-03-15 17:24:39,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:39,122 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 77 treesize of output 77 [2022-03-15 17:24:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 254 proven. 15 refuted. 0 times theorem prover too weak. 288 trivial. 2 not checked. [2022-03-15 17:24:39,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669079046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:39,250 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:39,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 28 [2022-03-15 17:24:39,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134933965] [2022-03-15 17:24:39,250 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:39,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:39,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 205 states and 297 transitions. [2022-03-15 17:24:39,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:40,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:40,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 17:24:40,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 17:24:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=4, NotChecked=50, Total=756 [2022-03-15 17:24:40,289 INFO L87 Difference]: Start difference. First operand 630 states and 1189 transitions. Second operand has 16 states, 16 states have (on average 7.8125) internal successors, (125), 16 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:40,509 INFO L93 Difference]: Finished difference Result 706 states and 1330 transitions. [2022-03-15 17:24:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 17:24:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.8125) internal successors, (125), 16 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-03-15 17:24:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:40,512 INFO L225 Difference]: With dead ends: 706 [2022-03-15 17:24:40,512 INFO L226 Difference]: Without dead ends: 706 [2022-03-15 17:24:40,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=4, NotChecked=50, Total=756 [2022-03-15 17:24:40,513 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 295 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:40,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 24 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-03-15 17:24:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 670. [2022-03-15 17:24:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 1.8878923766816142) internal successors, (1263), 669 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1263 transitions. [2022-03-15 17:24:40,552 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1263 transitions. Word has length 111 [2022-03-15 17:24:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:40,557 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1263 transitions. [2022-03-15 17:24:40,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.8125) internal successors, (125), 16 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1263 transitions. [2022-03-15 17:24:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-15 17:24:40,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:40,558 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:40,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 17:24:40,774 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,SelfDestructingSolverStorable15 [2022-03-15 17:24:40,775 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2012820482, now seen corresponding path program 13 times [2022-03-15 17:24:40,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:40,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839083006] [2022-03-15 17:24:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:41,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:41,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839083006] [2022-03-15 17:24:41,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839083006] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:41,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868836609] [2022-03-15 17:24:41,033 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:24:41,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:41,034 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-03-15 17:24:41,035 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-03-15 17:24:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:41,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 17:24:41,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:41,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:41,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868836609] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:41,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:41,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-03-15 17:24:41,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182540369] [2022-03-15 17:24:41,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:41,859 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:42,502 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 318 transitions. [2022-03-15 17:24:42,502 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:43,275 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:43,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 17:24:43,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 17:24:43,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=828, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 17:24:43,277 INFO L87 Difference]: Start difference. First operand 670 states and 1263 transitions. Second operand has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:43,564 INFO L93 Difference]: Finished difference Result 746 states and 1404 transitions. [2022-03-15 17:24:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:24:43,564 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-03-15 17:24:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:43,567 INFO L225 Difference]: With dead ends: 746 [2022-03-15 17:24:43,567 INFO L226 Difference]: Without dead ends: 746 [2022-03-15 17:24:43,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=828, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 17:24:43,567 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 451 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:43,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 26 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:24:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-03-15 17:24:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 710. [2022-03-15 17:24:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.8857545839210155) internal successors, (1337), 709 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1337 transitions. [2022-03-15 17:24:43,576 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1337 transitions. Word has length 118 [2022-03-15 17:24:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:43,576 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 1337 transitions. [2022-03-15 17:24:43,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1337 transitions. [2022-03-15 17:24:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-03-15 17:24:43,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:43,578 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:43,595 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-03-15 17:24:43,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 17:24:43,791 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 689988952, now seen corresponding path program 14 times [2022-03-15 17:24:43,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:43,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235863207] [2022-03-15 17:24:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:44,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:44,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235863207] [2022-03-15 17:24:44,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235863207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:44,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858030995] [2022-03-15 17:24:44,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:24:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:44,081 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:24:44,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 17:24:44,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:24:44,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:44,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 17:24:44,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:44,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:44,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858030995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:44,786 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:44,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2022-03-15 17:24:44,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615503968] [2022-03-15 17:24:44,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:44,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:45,537 INFO L252 McrAutomatonBuilder]: Finished intersection with 233 states and 339 transitions. [2022-03-15 17:24:45,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:45,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:45,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 17:24:45,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 17:24:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:45,996 INFO L87 Difference]: Start difference. First operand 710 states and 1337 transitions. Second operand has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:46,220 INFO L93 Difference]: Finished difference Result 786 states and 1478 transitions. [2022-03-15 17:24:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:24:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-03-15 17:24:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:46,223 INFO L225 Difference]: With dead ends: 786 [2022-03-15 17:24:46,223 INFO L226 Difference]: Without dead ends: 786 [2022-03-15 17:24:46,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:24:46,223 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 330 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:46,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 23 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-03-15 17:24:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 750. [2022-03-15 17:24:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.883845126835781) internal successors, (1411), 749 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1411 transitions. [2022-03-15 17:24:46,232 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1411 transitions. Word has length 125 [2022-03-15 17:24:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:46,233 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1411 transitions. [2022-03-15 17:24:46,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1411 transitions. [2022-03-15 17:24:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-15 17:24:46,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:46,234 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:46,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 17:24:46,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:46,449 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 760555330, now seen corresponding path program 15 times [2022-03-15 17:24:46,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:46,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851057463] [2022-03-15 17:24:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:46,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:46,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851057463] [2022-03-15 17:24:46,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851057463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:46,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472593908] [2022-03-15 17:24:46,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:24:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:46,692 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:24:46,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 17:24:47,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:24:47,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:24:47,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 17:24:47,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:24:47,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:24:47,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:47,665 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-03-15 17:24:47,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:24:47,732 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:24:47,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:24:47,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:24:47,791 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-03-15 17:24:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 130 proven. 75 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-03-15 17:24:47,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:24:50,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_487| Int) (v_ArrVal_3457 Int) (v_ArrVal_3456 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3456) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_487| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_487| 4)) v_ArrVal_3457) .cse1) 20)))) is different from false [2022-03-15 17:24:50,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:50,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:24:50,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:50,576 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 78 treesize of output 80 [2022-03-15 17:24:50,593 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 63 treesize of output 55 [2022-03-15 17:24:50,600 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 8 treesize of output 4 [2022-03-15 17:24:50,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:24:50,728 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 80 treesize of output 80 [2022-03-15 17:24:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 651 trivial. 14 not checked. [2022-03-15 17:24:50,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472593908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:24:50,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:24:50,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 31 [2022-03-15 17:24:50,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578502857] [2022-03-15 17:24:50,992 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:24:51,031 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:24:51,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 247 states and 360 transitions. [2022-03-15 17:24:51,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:24:52,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:24:52,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 17:24:52,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:24:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 17:24:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=654, Unknown=6, NotChecked=56, Total=930 [2022-03-15 17:24:52,404 INFO L87 Difference]: Start difference. First operand 750 states and 1411 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:24:52,672 INFO L93 Difference]: Finished difference Result 826 states and 1552 transitions. [2022-03-15 17:24:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 17:24:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-03-15 17:24:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:24:52,675 INFO L225 Difference]: With dead ends: 826 [2022-03-15 17:24:52,675 INFO L226 Difference]: Without dead ends: 826 [2022-03-15 17:24:52,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=214, Invalid=654, Unknown=6, NotChecked=56, Total=930 [2022-03-15 17:24:52,676 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 282 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:24:52,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 36 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:24:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-03-15 17:24:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 790. [2022-03-15 17:24:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.88212927756654) internal successors, (1485), 789 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1485 transitions. [2022-03-15 17:24:52,688 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1485 transitions. Word has length 132 [2022-03-15 17:24:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:24:52,688 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 1485 transitions. [2022-03-15 17:24:52,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:24:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1485 transitions. [2022-03-15 17:24:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-03-15 17:24:52,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:24:52,690 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:24:52,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 17:24:52,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:52,903 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:24:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:24:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2101889560, now seen corresponding path program 16 times [2022-03-15 17:24:52,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:24:52,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484798506] [2022-03-15 17:24:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:24:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:24:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:24:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:24:53,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:24:53,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484798506] [2022-03-15 17:24:53,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484798506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:24:53,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8108545] [2022-03-15 17:24:53,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:24:53,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:24:53,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:24:53,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:24:53,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 17:28:22,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:28:22,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:28:22,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 17:28:22,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:28:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:22,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:28:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:23,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8108545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:28:23,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:28:23,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 23 [2022-03-15 17:28:23,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425568497] [2022-03-15 17:28:23,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:28:23,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:28:24,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 261 states and 381 transitions. [2022-03-15 17:28:24,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:28:24,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:28:24,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 17:28:24,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:28:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 17:28:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:28:24,820 INFO L87 Difference]: Start difference. First operand 790 states and 1485 transitions. Second operand has 20 states, 20 states have (on average 7.85) internal successors, (157), 20 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:28:25,121 INFO L93 Difference]: Finished difference Result 866 states and 1626 transitions. [2022-03-15 17:28:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 17:28:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.85) internal successors, (157), 20 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-03-15 17:28:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:28:25,124 INFO L225 Difference]: With dead ends: 866 [2022-03-15 17:28:25,124 INFO L226 Difference]: Without dead ends: 866 [2022-03-15 17:28:25,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:28:25,124 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 287 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:28:25,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 40 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:28:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-03-15 17:28:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 830. [2022-03-15 17:28:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.8805790108564535) internal successors, (1559), 829 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1559 transitions. [2022-03-15 17:28:25,134 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1559 transitions. Word has length 139 [2022-03-15 17:28:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:28:25,135 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 1559 transitions. [2022-03-15 17:28:25,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.85) internal successors, (157), 20 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1559 transitions. [2022-03-15 17:28:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-03-15 17:28:25,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:28:25,136 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:28:25,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 17:28:25,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:25,359 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:28:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:28:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1540986238, now seen corresponding path program 17 times [2022-03-15 17:28:25,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:28:25,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89824415] [2022-03-15 17:28:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:28:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:28:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:28:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:25,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:28:25,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89824415] [2022-03-15 17:28:25,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89824415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:28:25,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749928011] [2022-03-15 17:28:25,585 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:28:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:28:25,586 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:28:25,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 17:28:25,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 17:28:25,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:28:25,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 17:28:25,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:28:25,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:28:25,960 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-03-15 17:28:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-03-15 17:28:26,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:28:26,056 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-03-15 17:28:26,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 63 [2022-03-15 17:28:26,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:28:26,134 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 49 treesize of output 48 [2022-03-15 17:28:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-03-15 17:28:26,305 INFO L353 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-03-15 17:28:26,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 31 [2022-03-15 17:28:26,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:28:26,346 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:28:26,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 17:28:26,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:28:26,373 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-03-15 17:28:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 487 proven. 8 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-03-15 17:28:26,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:28:31,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4181 Int) (v_ArrVal_4182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_644| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4181)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_644| 4) |c_~#queue~0.offset|) v_ArrVal_4182) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_644| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:28:47,118 INFO L353 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2022-03-15 17:28:47,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2022-03-15 17:28:47,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:47,125 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 73 treesize of output 73 [2022-03-15 17:28:47,148 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 8 treesize of output 4 [2022-03-15 17:28:47,174 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:47,174 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 52 treesize of output 52 [2022-03-15 17:28:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 485 proven. 9 refuted. 0 times theorem prover too weak. 594 trivial. 1 not checked. [2022-03-15 17:28:47,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749928011] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:28:47,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:28:47,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 39 [2022-03-15 17:28:47,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495507889] [2022-03-15 17:28:47,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:28:47,289 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:28:48,671 INFO L252 McrAutomatonBuilder]: Finished intersection with 275 states and 402 transitions. [2022-03-15 17:28:48,672 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:28:49,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:28:49,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 17:28:49,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:28:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 17:28:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1100, Unknown=13, NotChecked=72, Total=1482 [2022-03-15 17:28:49,228 INFO L87 Difference]: Start difference. First operand 830 states and 1559 transitions. Second operand has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 21 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:28:49,470 INFO L93 Difference]: Finished difference Result 906 states and 1700 transitions. [2022-03-15 17:28:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 17:28:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 21 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-03-15 17:28:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:28:49,473 INFO L225 Difference]: With dead ends: 906 [2022-03-15 17:28:49,473 INFO L226 Difference]: Without dead ends: 906 [2022-03-15 17:28:49,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=297, Invalid=1100, Unknown=13, NotChecked=72, Total=1482 [2022-03-15 17:28:49,474 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 439 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:28:49,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 26 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:28:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-03-15 17:28:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 870. [2022-03-15 17:28:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.8791714614499424) internal successors, (1633), 869 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1633 transitions. [2022-03-15 17:28:49,485 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1633 transitions. Word has length 146 [2022-03-15 17:28:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:28:49,485 INFO L470 AbstractCegarLoop]: Abstraction has 870 states and 1633 transitions. [2022-03-15 17:28:49,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 21 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1633 transitions. [2022-03-15 17:28:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-03-15 17:28:49,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:28:49,487 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:28:49,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 17:28:49,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:49,706 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:28:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:28:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -798957864, now seen corresponding path program 18 times [2022-03-15 17:28:49,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:28:49,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440037913] [2022-03-15 17:28:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:28:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:28:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:28:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:50,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:28:50,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440037913] [2022-03-15 17:28:50,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440037913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:28:50,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515096069] [2022-03-15 17:28:50,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:28:50,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:50,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:28:50,064 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:28:50,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 17:28:52,608 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 17:28:52,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:28:52,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 17:28:52,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:28:52,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:28:52,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:28:52,761 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-03-15 17:28:52,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:28:52,798 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:28:52,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:28:52,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:28:52,818 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-03-15 17:28:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 493 proven. 20 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-03-15 17:28:52,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:28:55,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4567 Int) (v_ArrVal_4566 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_713| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4566) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_713| 4) |c_~#queue~0.offset|) v_ArrVal_4567) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_713| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:28:55,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:55,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:28:55,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:55,369 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 78 treesize of output 80 [2022-03-15 17:28:55,373 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 63 treesize of output 55 [2022-03-15 17:28:55,379 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 8 treesize of output 4 [2022-03-15 17:28:55,392 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:55,392 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 72 treesize of output 72 [2022-03-15 17:28:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 490 proven. 20 refuted. 0 times theorem prover too weak. 703 trivial. 3 not checked. [2022-03-15 17:28:55,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515096069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:28:55,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:28:55,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 7, 7] total 34 [2022-03-15 17:28:55,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922514004] [2022-03-15 17:28:55,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:28:55,619 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:28:56,926 INFO L252 McrAutomatonBuilder]: Finished intersection with 289 states and 423 transitions. [2022-03-15 17:28:56,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:28:58,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:28:58,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 17:28:58,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:28:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 17:28:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=830, Unknown=4, NotChecked=64, Total=1190 [2022-03-15 17:28:58,073 INFO L87 Difference]: Start difference. First operand 870 states and 1633 transitions. Second operand has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:28:58,373 INFO L93 Difference]: Finished difference Result 910 states and 1707 transitions. [2022-03-15 17:28:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 17:28:58,374 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-03-15 17:28:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:28:58,376 INFO L225 Difference]: With dead ends: 910 [2022-03-15 17:28:58,376 INFO L226 Difference]: Without dead ends: 910 [2022-03-15 17:28:58,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 426 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=4, NotChecked=64, Total=1190 [2022-03-15 17:28:58,377 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 571 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:28:58,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 30 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:28:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-03-15 17:28:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2022-03-15 17:28:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 1.8778877887788779) internal successors, (1707), 909 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1707 transitions. [2022-03-15 17:28:58,387 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1707 transitions. Word has length 153 [2022-03-15 17:28:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:28:58,387 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 1707 transitions. [2022-03-15 17:28:58,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:28:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1707 transitions. [2022-03-15 17:28:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-15 17:28:58,389 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:28:58,389 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:28:58,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 17:28:58,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:58,603 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:28:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:28:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1021377986, now seen corresponding path program 19 times [2022-03-15 17:28:58,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:28:58,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691773893] [2022-03-15 17:28:58,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:28:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:28:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:28:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 396 proven. 85 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2022-03-15 17:28:59,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:28:59,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691773893] [2022-03-15 17:28:59,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691773893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:28:59,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226113189] [2022-03-15 17:28:59,084 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:28:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:28:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:28:59,100 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:28:59,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 17:28:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:28:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 17:28:59,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:28:59,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:28:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:28:59,856 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-03-15 17:28:59,895 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:28:59,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 17:28:59,917 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 17:28:59,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-03-15 17:28:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 688 proven. 65 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-03-15 17:28:59,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:29:04,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4968 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_773| Int) (v_ArrVal_4967 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4967) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_773| 4)) v_ArrVal_4968) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_773| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:29:04,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:04,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-03-15 17:29:04,264 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:04,264 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 78 treesize of output 80 [2022-03-15 17:29:04,268 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 63 treesize of output 55 [2022-03-15 17:29:04,272 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 8 treesize of output 4 [2022-03-15 17:29:04,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:04,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-03-15 17:29:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 676 proven. 65 refuted. 0 times theorem prover too weak. 597 trivial. 12 not checked. [2022-03-15 17:29:04,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226113189] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:29:04,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:29:04,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 17:29:04,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755696020] [2022-03-15 17:29:04,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:29:04,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:29:06,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 303 states and 444 transitions. [2022-03-15 17:29:06,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:29:07,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:29:07,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:29:07,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:29:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:29:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=272, Unknown=9, NotChecked=34, Total=380 [2022-03-15 17:29:07,550 INFO L87 Difference]: Start difference. First operand 910 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:07,720 INFO L93 Difference]: Finished difference Result 1566 states and 2871 transitions. [2022-03-15 17:29:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:29:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-03-15 17:29:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:07,725 INFO L225 Difference]: With dead ends: 1566 [2022-03-15 17:29:07,725 INFO L226 Difference]: Without dead ends: 1566 [2022-03-15 17:29:07,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=90, Invalid=325, Unknown=9, NotChecked=38, Total=462 [2022-03-15 17:29:07,725 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:07,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 6 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:29:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-03-15 17:29:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1354. [2022-03-15 17:29:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.8351810790835181) internal successors, (2483), 1353 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2483 transitions. [2022-03-15 17:29:07,741 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2483 transitions. Word has length 160 [2022-03-15 17:29:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:07,741 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 2483 transitions. [2022-03-15 17:29:07,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2483 transitions. [2022-03-15 17:29:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-03-15 17:29:07,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:07,744 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:07,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 17:29:07,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:29:07,962 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:29:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1842647480, now seen corresponding path program 1 times [2022-03-15 17:29:07,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:07,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749376369] [2022-03-15 17:29:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2022-03-15 17:29:08,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:08,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749376369] [2022-03-15 17:29:08,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749376369] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:29:08,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:29:08,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:29:08,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925035672] [2022-03-15 17:29:08,208 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:29:08,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:29:10,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 314 states and 457 transitions. [2022-03-15 17:29:10,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:29:10,827 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:29:10,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:29:10,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:29:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:29:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:29:10,828 INFO L87 Difference]: Start difference. First operand 1354 states and 2483 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:10,923 INFO L93 Difference]: Finished difference Result 1464 states and 2663 transitions. [2022-03-15 17:29:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:29:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-03-15 17:29:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:10,927 INFO L225 Difference]: With dead ends: 1464 [2022-03-15 17:29:10,927 INFO L226 Difference]: Without dead ends: 1464 [2022-03-15 17:29:10,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:29:10,928 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:10,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:29:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-03-15 17:29:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1344. [2022-03-15 17:29:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.8339538346984363) internal successors, (2463), 1343 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2463 transitions. [2022-03-15 17:29:10,943 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2463 transitions. Word has length 169 [2022-03-15 17:29:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:10,944 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 2463 transitions. [2022-03-15 17:29:10,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2463 transitions. [2022-03-15 17:29:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-15 17:29:10,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:10,946 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:10,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 17:29:10,946 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:29:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1465838594, now seen corresponding path program 2 times [2022-03-15 17:29:10,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:10,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334743439] [2022-03-15 17:29:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2022-03-15 17:29:11,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:11,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334743439] [2022-03-15 17:29:11,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334743439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:29:11,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:29:11,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:29:11,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1646008243] [2022-03-15 17:29:11,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:29:11,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:29:13,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 323 states and 474 transitions. [2022-03-15 17:29:13,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:29:13,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:29:13,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:29:13,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:29:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:29:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:29:13,975 INFO L87 Difference]: Start difference. First operand 1344 states and 2463 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:14,063 INFO L93 Difference]: Finished difference Result 1359 states and 2488 transitions. [2022-03-15 17:29:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:29:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-15 17:29:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:14,067 INFO L225 Difference]: With dead ends: 1359 [2022-03-15 17:29:14,067 INFO L226 Difference]: Without dead ends: 1359 [2022-03-15 17:29:14,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:29:14,067 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:14,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:29:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-03-15 17:29:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1353. [2022-03-15 17:29:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1352 states have (on average 1.8328402366863905) internal successors, (2478), 1352 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2478 transitions. [2022-03-15 17:29:14,082 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2478 transitions. Word has length 170 [2022-03-15 17:29:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:14,082 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 2478 transitions. [2022-03-15 17:29:14,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2478 transitions. [2022-03-15 17:29:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-15 17:29:14,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:14,085 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:14,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 17:29:14,085 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:29:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 218323714, now seen corresponding path program 3 times [2022-03-15 17:29:14,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:14,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136838585] [2022-03-15 17:29:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2022-03-15 17:29:14,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:14,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136838585] [2022-03-15 17:29:14,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136838585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:29:14,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498201391] [2022-03-15 17:29:14,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:29:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:29:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:29:14,497 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:29:14,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 17:29:15,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 17:29:15,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:29:15,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 17:29:15,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:29:16,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:29:16,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:16,403 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-03-15 17:29:16,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:29:16,456 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-03-15 17:29:16,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-03-15 17:29:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:16,502 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-03-15 17:29:16,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 17:29:16,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:16,583 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-03-15 17:29:16,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:29:16,642 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-03-15 17:29:16,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-03-15 17:29:16,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:16,697 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-03-15 17:29:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 239 proven. 95 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2022-03-15 17:29:16,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:29:16,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse1)) 20))) is different from false [2022-03-15 17:29:16,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse1))))) is different from false [2022-03-15 17:29:16,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse1)) 20))) is different from false [2022-03-15 17:29:16,849 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse1)) 20)))) is different from false [2022-03-15 17:29:16,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 Int) (v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5765)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (not (= 20 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse2)))))))) is different from false [2022-03-15 17:29:16,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 Int) (v_ArrVal_5763 Int) (v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5763) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5765)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse1)) 20)) (= .cse4 20))))) is different from false [2022-03-15 17:29:16,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 Int) (v_ArrVal_5763 Int) (v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_5763)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_5765))) (let ((.cse0 (select .cse3 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_5770)) .cse2) 20))))))) is different from false [2022-03-15 17:29:16,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5762 (Array Int Int)) (v_ArrVal_5765 Int) (v_ArrVal_5763 Int) (v_ArrVal_5769 (Array Int Int)) (v_ArrVal_5770 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5762))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse2))) v_ArrVal_5763)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_5765))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_5769) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_5770)) .cse2) 20))))))) is different from false [2022-03-15 17:29:16,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:16,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 321 treesize of output 211 [2022-03-15 17:29:16,965 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:16,966 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 308 treesize of output 298 [2022-03-15 17:29:17,029 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 272 treesize of output 248 [2022-03-15 17:29:17,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:29:17,035 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 376 treesize of output 328 [2022-03-15 17:29:17,093 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 8 treesize of output 4 [2022-03-15 17:29:17,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:17,109 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 428 treesize of output 388 [2022-03-15 17:29:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 76 proven. 126 refuted. 0 times theorem prover too weak. 861 trivial. 132 not checked. [2022-03-15 17:29:17,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498201391] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:29:17,458 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:29:17,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 16] total 37 [2022-03-15 17:29:17,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189748153] [2022-03-15 17:29:17,458 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:29:17,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:29:19,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 323 states and 474 transitions. [2022-03-15 17:29:19,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:29:20,467 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:29:20,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 17:29:20,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:29:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 17:29:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=677, Unknown=8, NotChecked=504, Total=1406 [2022-03-15 17:29:20,468 INFO L87 Difference]: Start difference. First operand 1353 states and 2478 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:20,737 INFO L93 Difference]: Finished difference Result 2427 states and 4374 transitions. [2022-03-15 17:29:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 17:29:20,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-15 17:29:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:20,744 INFO L225 Difference]: With dead ends: 2427 [2022-03-15 17:29:20,744 INFO L226 Difference]: Without dead ends: 2427 [2022-03-15 17:29:20,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=965, Unknown=8, NotChecked=600, Total=1892 [2022-03-15 17:29:20,745 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 172 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:20,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 18 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:29:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-03-15 17:29:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1937. [2022-03-15 17:29:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1936 states have (on average 1.8088842975206612) internal successors, (3502), 1936 states have internal predecessors, (3502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 3502 transitions. [2022-03-15 17:29:20,780 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 3502 transitions. Word has length 170 [2022-03-15 17:29:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:20,780 INFO L470 AbstractCegarLoop]: Abstraction has 1937 states and 3502 transitions. [2022-03-15 17:29:20,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:29:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 3502 transitions. [2022-03-15 17:29:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-03-15 17:29:20,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:20,784 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 13, 13, 13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:20,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 17:29:20,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 17:29:21,000 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:29:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2131698740, now seen corresponding path program 4 times [2022-03-15 17:29:21,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:21,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641017313] [2022-03-15 17:29:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 218 proven. 5 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2022-03-15 17:29:21,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:21,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641017313] [2022-03-15 17:29:21,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641017313] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:29:21,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882564438] [2022-03-15 17:29:21,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:29:21,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:29:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:29:21,583 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:29:21,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 17:31:29,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:31:29,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:31:29,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 17:31:29,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:31:29,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:31:29,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:29,946 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-03-15 17:31:29,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:30,003 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:31:30,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:31:30,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:30,038 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-03-15 17:31:30,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 17:31:30,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:30,113 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 18 treesize of output 20 [2022-03-15 17:31:30,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:30,162 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:31:30,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-03-15 17:31:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:30,201 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-03-15 17:31:30,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 17:31:30,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:30,276 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 18 treesize of output 20 [2022-03-15 17:31:30,327 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-15 17:31:30,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 36 treesize of output 32 [2022-03-15 17:31:30,357 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 17:31:30,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-03-15 17:31:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 512 proven. 28 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-03-15 17:31:30,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:31:35,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6185 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20))))) is different from false [2022-03-15 17:31:35,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6185 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:31:35,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6185 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20))))) is different from false [2022-03-15 17:31:36,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6181)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20))))) is different from false [2022-03-15 17:31:36,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6179) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6181)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20))))) is different from false [2022-03-15 17:31:36,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20)))))) is different from false [2022-03-15 17:31:36,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse2 .cse1)))))))) is different from false [2022-03-15 17:31:36,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20))))))) is different from false [2022-03-15 17:31:36,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse2 .cse1))) (not (= 20 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1)))))))) is different from false [2022-03-15 17:31:36,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6173 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6173)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse2 .cse1)))))))) is different from false [2022-03-15 17:31:36,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6172) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6173)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6181))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1)))))))) is different from false [2022-03-15 17:31:36,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| 4) |c_~#queue~0.offset|) v_ArrVal_6172) .cse6 v_ArrVal_6173))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) .cse6 v_ArrVal_6181))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse3 .cse1))))))))) is different from false [2022-03-15 17:31:36,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6177 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| Int) (v_ArrVal_6185 Int) (v_ArrVal_6173 Int) (v_ArrVal_6172 Int) (v_ArrVal_6181 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| Int) (v_ArrVal_6170 (Array Int Int)) (v_ArrVal_6179 Int) (v_ArrVal_6184 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6170))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| 4) |c_~#queue~0.offset|) v_ArrVal_6172) .cse6 v_ArrVal_6173))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6177))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| 4)) v_ArrVal_6179) .cse6 v_ArrVal_6181))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6184) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| 4)) v_ArrVal_6185) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1028| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1032| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1030| (select .cse3 .cse1)))))))))) is different from false [2022-03-15 17:31:36,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:31:36,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 739 treesize of output 529 [2022-03-15 17:31:36,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:31:36,473 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 873 treesize of output 863 [2022-03-15 17:31:36,484 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 2666 treesize of output 2638 [2022-03-15 17:31:36,504 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 2434 treesize of output 2402 [2022-03-15 17:31:36,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:36,522 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 2772 treesize of output 2748 [2022-03-15 17:31:36,616 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 8 treesize of output 4 [2022-03-15 17:31:37,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:31:37,042 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 2921 treesize of output 2885 [2022-03-15 17:31:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 486 proven. 10 refuted. 0 times theorem prover too weak. 706 trivial. 44 not checked. [2022-03-15 17:31:37,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882564438] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:31:37,630 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:31:37,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 19] total 41 [2022-03-15 17:31:37,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493856552] [2022-03-15 17:31:37,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:31:37,694 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:31:40,184 INFO L252 McrAutomatonBuilder]: Finished intersection with 329 states and 483 transitions. [2022-03-15 17:31:40,184 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:31:40,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:31:40,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:31:40,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:31:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:31:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=659, Unknown=20, NotChecked=858, Total=1722 [2022-03-15 17:31:40,986 INFO L87 Difference]: Start difference. First operand 1937 states and 3502 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:31:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:31:41,266 INFO L93 Difference]: Finished difference Result 2057 states and 3693 transitions. [2022-03-15 17:31:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 17:31:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2022-03-15 17:31:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:31:41,272 INFO L225 Difference]: With dead ends: 2057 [2022-03-15 17:31:41,272 INFO L226 Difference]: Without dead ends: 2057 [2022-03-15 17:31:41,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=257, Invalid=965, Unknown=20, NotChecked=1014, Total=2256 [2022-03-15 17:31:41,273 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:31:41,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:31:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2022-03-15 17:31:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1883. [2022-03-15 17:31:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 1.808182784272051) internal successors, (3403), 1882 states have internal predecessors, (3403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:31:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 3403 transitions. [2022-03-15 17:31:41,297 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 3403 transitions. Word has length 173 [2022-03-15 17:31:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:31:41,297 INFO L470 AbstractCegarLoop]: Abstraction has 1883 states and 3403 transitions. [2022-03-15 17:31:41,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:31:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 3403 transitions. [2022-03-15 17:31:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-03-15 17:31:41,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:31:41,301 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 13, 13, 13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:31:41,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 17:31:41,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 17:31:41,527 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-15 17:31:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:31:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 842436812, now seen corresponding path program 5 times [2022-03-15 17:31:41,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:31:41,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950664944] [2022-03-15 17:31:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:31:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:31:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:31:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 218 proven. 5 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2022-03-15 17:31:41,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:31:41,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950664944] [2022-03-15 17:31:41,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950664944] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:31:41,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476453054] [2022-03-15 17:31:41,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:31:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:31:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:31:41,991 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:31:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 17:31:46,155 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-15 17:31:46,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:31:46,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 169 conjunts are in the unsatisfiable core [2022-03-15 17:31:46,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:31:46,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 17:31:46,270 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-03-15 17:31:46,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 38 [2022-03-15 17:31:46,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:46,361 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-03-15 17:31:46,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 63 [2022-03-15 17:31:46,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:46,438 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 49 treesize of output 48 [2022-03-15 17:31:46,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 67 treesize of output 45 [2022-03-15 17:31:46,595 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-03-15 17:31:46,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 65 treesize of output 72 [2022-03-15 17:31:46,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:46,743 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-03-15 17:31:46,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 59 [2022-03-15 17:31:46,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:46,815 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 49 treesize of output 48 [2022-03-15 17:31:46,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 67 treesize of output 45 [2022-03-15 17:31:46,987 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-03-15 17:31:46,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 65 treesize of output 72 [2022-03-15 17:31:47,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:47,138 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-03-15 17:31:47,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 59 [2022-03-15 17:31:47,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:47,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2022-03-15 17:31:47,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 13 [2022-03-15 17:31:47,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:47,333 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 25 treesize of output 24 [2022-03-15 17:31:47,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:47,443 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:31:47,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:31:47,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:47,542 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-03-15 17:31:47,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 17:31:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:47,686 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 27 treesize of output 26 [2022-03-15 17:31:47,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:47,799 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:31:47,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:31:47,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:47,867 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-03-15 17:31:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 17:31:48,022 INFO L353 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-03-15 17:31:48,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 31 [2022-03-15 17:31:48,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:31:48,105 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-15 17:31:48,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-03-15 17:31:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:48,154 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-03-15 17:31:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 906 proven. 51 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-03-15 17:31:48,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:31:59,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6625)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:32:01,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6625))) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:32:03,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6625))) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1)))))) is different from false [2022-03-15 17:34:18,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618)))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6621))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20))))))) is different from false [2022-03-15 17:34:21,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6621))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse2 .cse1))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1)))))))) is different from false [2022-03-15 17:34:23,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6621))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1)))))))) is different from false [2022-03-15 17:34:26,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (v_ArrVal_6613 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6613)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6621))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1)))))))) is different from false [2022-03-15 17:34:28,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (v_ArrVal_6613 Int) (v_ArrVal_6611 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6611) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_6613)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (let ((.cse3 (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) (+ 88 |c_~#queue~0.offset|) v_ArrVal_6621))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1)))))))) is different from false [2022-03-15 17:34:31,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int) (v_ArrVal_6625 Int) (v_ArrVal_6613 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| Int) (v_ArrVal_6611 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| 4)) v_ArrVal_6611) .cse7 v_ArrVal_6613))) (store .cse9 .cse1 (+ 1 (select .cse9 .cse1))))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6618))))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (let ((.cse4 (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) .cse7 v_ArrVal_6621))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse3 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)))))))) is different from false [2022-03-15 17:34:34,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (v_ArrVal_6625 Int) (v_ArrVal_6613 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| Int) (v_ArrVal_6611 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6610 Int) (|v_t1Thread1of1ForFork0_~i~0#1_728| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6610)))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| 4)) v_ArrVal_6611) .cse7 v_ArrVal_6613))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_728| 4) |c_~#stored_elements~0.offset|) v_ArrVal_6618))))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (let ((.cse4 (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) .cse7 v_ArrVal_6621))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_728|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse2 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_728| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse3 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20))))))))) is different from false [2022-03-15 17:34:39,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6628 Int) (v_ArrVal_6625 Int) (v_ArrVal_6613 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| Int) (v_ArrVal_6611 Int) (|v_t1Thread1of1ForFork0_~i~0#1_727| Int) (v_ArrVal_6610 Int) (|v_t1Thread1of1ForFork0_~i~0#1_728| Int) (v_ArrVal_6621 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| Int) (v_ArrVal_6620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| Int)) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) 1)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_6610))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| 4)) v_ArrVal_6611) .cse7 v_ArrVal_6613))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_728| 4) |c_~#stored_elements~0.offset|) v_ArrVal_6618))))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (let ((.cse4 (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| 4) |c_~#queue~0.offset|) v_ArrVal_6620) .cse7 v_ArrVal_6621))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_727| 4)) v_ArrVal_6625))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_728|)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_728| 1) |v_t1Thread1of1ForFork0_~i~0#1_727|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1103| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1105| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| 4) |c_~#queue~0.offset|) v_ArrVal_6628) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_1101| (select .cse3 .cse1)))))))))) is different from false Received shutdown request... [2022-03-15 17:37:15,446 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 17:37:15,446 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 17:37:15,965 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 17:37:15,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 17:37:16,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 17:37:16,166 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. [2022-03-15 17:37:16,174 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-03-15 17:37:16,174 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 17:37:16,174 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 17:37:16,174 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-03-15 17:37:16,175 INFO L732 BasicCegarLoop]: Path program histogram: [19, 5, 1, 1, 1, 1] [2022-03-15 17:37:16,178 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:37:16,178 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:37:16,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:37:16 BasicIcfg [2022-03-15 17:37:16,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:37:16,180 INFO L158 Benchmark]: Toolchain (without parser) took 850296.15ms. Allocated memory was 194.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 136.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.83ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 136.4MB in the beginning and 215.4MB in the end (delta: -79.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.21ms. Allocated memory is still 263.2MB. Free memory was 215.4MB in the beginning and 212.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: Boogie Preprocessor took 46.27ms. Allocated memory is still 263.2MB. Free memory was 212.8MB in the beginning and 210.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: RCFGBuilder took 487.46ms. Allocated memory is still 263.2MB. Free memory was 210.7MB in the beginning and 191.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-15 17:37:16,180 INFO L158 Benchmark]: TraceAbstraction took 849196.41ms. Allocated memory was 263.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 190.7MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-15 17:37:16,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.83ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 136.4MB in the beginning and 215.4MB in the end (delta: -79.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.21ms. Allocated memory is still 263.2MB. Free memory was 215.4MB in the beginning and 212.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.27ms. Allocated memory is still 263.2MB. Free memory was 212.8MB in the beginning and 210.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.46ms. Allocated memory is still 263.2MB. Free memory was 210.7MB in the beginning and 191.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 849196.41ms. Allocated memory was 263.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 190.7MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 225 PlacesBefore, 51 PlacesAfterwards, 231 TransitionsBefore, 51 TransitionsAfterwards, 10630 CoEnabledTransitionPairs, 8 FixpointIterations, 83 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 20 ConcurrentYvCompositions, 6 ChoiceCompositions, 215 TotalNumberOfCompositions, 22451 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10447, positive: 9932, positive conditional: 0, positive unconditional: 9932, negative: 515, negative conditional: 0, negative unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5862, positive: 5761, positive conditional: 0, positive unconditional: 5761, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10447, positive: 4171, positive conditional: 0, positive unconditional: 4171, negative: 414, negative conditional: 0, negative unconditional: 414, unknown: 5862, unknown conditional: 0, unknown unconditional: 5862] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 278, Positive conditional cache size: 0, Positive unconditional cache size: 278, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 - 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: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 174 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 849.0s, OverallIterations: 28, TraceHistogramMax: 20, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4554 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4554 mSDsluCounter, 493 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3676 mSDsCounter, 644 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5968 IncrementalHoareTripleChecker+Invalid, 6612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 644 mSolverCounterUnsat, 101 mSDtfsCounter, 5968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6788 GetRequests, 6226 SyntacticMatches, 26 SemanticMatches, 536 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 92.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1937occurred in iteration=26, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 1614 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 350.3s SatisfiabilityAnalysisTime, 111.8s InterpolantComputationTime, 4779 NumberOfCodeBlocks, 4102 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 6896 ConstructedInterpolants, 83 QuantifiedInterpolants, 32336 SizeOfPredicates, 213 NumberOfNonLiveVariables, 12189 ConjunctsInSsa, 692 ConjunctsInUnsatCore, 69 InterpolantComputations, 6 PerfectInterpolantSequences, 22313/38272 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