/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-15 22:18:41,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 22:18:41,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 22:18:41,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 22:18:41,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 22:18:41,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 22:18:41,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 22:18:41,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 22:18:41,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 22:18:41,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 22:18:41,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 22:18:41,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 22:18:41,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 22:18:41,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 22:18:41,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 22:18:41,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 22:18:41,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 22:18:41,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 22:18:41,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 22:18:41,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 22:18:41,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 22:18:41,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 22:18:41,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 22:18:41,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 22:18:41,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 22:18:41,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 22:18:41,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 22:18:41,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 22:18:41,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 22:18:41,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 22:18:41,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 22:18:41,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 22:18:41,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 22:18:41,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 22:18:41,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 22:18:41,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 22:18:41,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 22:18:41,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 22:18:41,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 22:18:41,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 22:18:41,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 22:18:41,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-15 22:18:41,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 22:18:41,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 22:18:41,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 22:18:41,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 22:18:41,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 22:18:41,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 22:18:41,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 22:18:41,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 22:18:41,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 22:18:41,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 22:18:41,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 22:18:41,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 22:18:41,657 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 22:18:41,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 22:18:41,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 22:18:41,658 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 22:18:41,658 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 22:18:41,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-11-15 22:18:41,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 22:18:41,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 22:18:41,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 22:18:41,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 22:18:41,864 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 22:18:41,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-11-15 22:18:41,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbfcdd07/005831439f6740dd8413818220ac5022/FLAGe9fe33b29 [2022-11-15 22:18:42,371 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 22:18:42,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-11-15 22:18:42,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbfcdd07/005831439f6740dd8413818220ac5022/FLAGe9fe33b29 [2022-11-15 22:18:42,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbfcdd07/005831439f6740dd8413818220ac5022 [2022-11-15 22:18:42,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 22:18:42,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 22:18:42,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 22:18:42,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 22:18:42,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 22:18:42,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2586cc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42, skipping insertion in model container [2022-11-15 22:18:42,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 22:18:42,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 22:18:42,784 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-15 22:18:42,791 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-15 22:18:42,801 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-15 22:18:42,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 22:18:42,809 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 22:18:42,855 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-15 22:18:42,856 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-15 22:18:42,858 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-15 22:18:42,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 22:18:42,892 INFO L208 MainTranslator]: Completed translation [2022-11-15 22:18:42,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42 WrapperNode [2022-11-15 22:18:42,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 22:18:42,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 22:18:42,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 22:18:42,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 22:18:42,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,929 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-11-15 22:18:42,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 22:18:42,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 22:18:42,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 22:18:42,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 22:18:42,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 22:18:42,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 22:18:42,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 22:18:42,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 22:18:42,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (1/1) ... [2022-11-15 22:18:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 22:18:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:18:43,007 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-11-15 22:18:43,060 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-11-15 22:18:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-15 22:18:43,071 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-15 22:18:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-15 22:18:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 22:18:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 22:18:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 22:18:43,074 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 22:18:43,207 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 22:18:43,208 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 22:18:43,488 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 22:18:43,497 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 22:18:43,497 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-15 22:18:43,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:43 BoogieIcfgContainer [2022-11-15 22:18:43,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 22:18:43,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 22:18:43,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 22:18:43,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 22:18:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:18:42" (1/3) ... [2022-11-15 22:18:43,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a03935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:18:43, skipping insertion in model container [2022-11-15 22:18:43,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:42" (2/3) ... [2022-11-15 22:18:43,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a03935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:18:43, skipping insertion in model container [2022-11-15 22:18:43,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:43" (3/3) ... [2022-11-15 22:18:43,516 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-15 22:18:43,522 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 22:18:43,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 22:18:43,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-15 22:18:43,541 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 22:18:43,656 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-15 22:18:43,690 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:18:43,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 22:18:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:18:43,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 22:18:43,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-15 22:18:43,804 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 22:18:43,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-15 22:18:43,829 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3312a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:18:43,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 22:18:44,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1072998195, now seen corresponding path program 1 times [2022-11-15 22:18:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:44,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334586661] [2022-11-15 22:18:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334586661] [2022-11-15 22:18:44,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334586661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:44,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:44,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 22:18:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400367911] [2022-11-15 22:18:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:44,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 22:18:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 22:18:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 22:18:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:44,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 22:18:44,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash 205824109, now seen corresponding path program 1 times [2022-11-15 22:18:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:44,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580230087] [2022-11-15 22:18:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:44,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:44,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580230087] [2022-11-15 22:18:44,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580230087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:44,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:44,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-15 22:18:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628105840] [2022-11-15 22:18:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:44,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 22:18:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 22:18:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 22:18:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:44,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 22:18:44,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1012824832, now seen corresponding path program 1 times [2022-11-15 22:18:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:44,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130504862] [2022-11-15 22:18:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130504862] [2022-11-15 22:18:45,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130504862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:45,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:45,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-15 22:18:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51679910] [2022-11-15 22:18:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-15 22:18:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-15 22:18:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-15 22:18:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:45,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:45,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:45,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:45,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:45,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:46,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-15 22:18:46,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash 969017787, now seen corresponding path program 1 times [2022-11-15 22:18:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054086265] [2022-11-15 22:18:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054086265] [2022-11-15 22:18:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054086265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:48,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:48,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-15 22:18:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017922343] [2022-11-15 22:18:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:48,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-15 22:18:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-15 22:18:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-15 22:18:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:48,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:48,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:48,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:48,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:48,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:48,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-15 22:18:50,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-15 22:18:50,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1518472118, now seen corresponding path program 1 times [2022-11-15 22:18:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:50,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472711190] [2022-11-15 22:18:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472711190] [2022-11-15 22:18:50,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472711190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:50,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:50,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-15 22:18:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260550790] [2022-11-15 22:18:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 22:18:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 22:18:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 22:18:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,193 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:50,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-11-15 22:18:50,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:50,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:50,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-15 22:18:50,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:50,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-15 22:18:50,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -133683344, now seen corresponding path program 1 times [2022-11-15 22:18:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:50,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119967564] [2022-11-15 22:18:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:53,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119967564] [2022-11-15 22:18:53,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119967564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:53,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:53,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-15 22:18:53,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225109154] [2022-11-15 22:18:53,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:53,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-15 22:18:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-15 22:18:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2022-11-15 22:18:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:53,216 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:53,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:53,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-15 22:18:55,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash -340878617, now seen corresponding path program 1 times [2022-11-15 22:18:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:55,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175199359] [2022-11-15 22:18:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:55,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175199359] [2022-11-15 22:18:55,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175199359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:55,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:55,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:18:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730095661] [2022-11-15 22:18:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:18:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:18:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:18:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:55,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:18:55,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-15 22:18:55,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:18:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:18:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1194863548, now seen corresponding path program 2 times [2022-11-15 22:18:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:18:55,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525133537] [2022-11-15 22:18:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:18:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:18:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:18:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:18:57,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:18:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525133537] [2022-11-15 22:18:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525133537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:18:57,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:18:57,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-15 22:18:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677898670] [2022-11-15 22:18:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:18:57,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-15 22:18:57,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:18:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-15 22:18:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-15 22:18:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:57,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:18:57,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:18:57,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:18:57,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-15 22:19:00,418 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 63692412, now seen corresponding path program 1 times [2022-11-15 22:19:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:00,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462455436] [2022-11-15 22:19:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462455436] [2022-11-15 22:19:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462455436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:00,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:00,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126970373] [2022-11-15 22:19:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:00,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,495 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:00,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 22:19:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:00,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-15 22:19:00,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -587525970, now seen corresponding path program 1 times [2022-11-15 22:19:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794699340] [2022-11-15 22:19:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:01,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794699340] [2022-11-15 22:19:01,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794699340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:01,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:01,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-15 22:19:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372055773] [2022-11-15 22:19:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-15 22:19:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-15 22:19:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-15 22:19:01,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:01,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:01,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-15 22:19:01,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-15 22:19:01,405 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-15 22:19:01,406 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-15 22:19:01,412 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:01,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 22:19:01,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:01,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 22:19:01,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-15 22:19:01,451 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 22:19:01,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-15 22:19:01,451 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3312a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:01,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-15 22:19:01,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-15 22:19:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1751721974, now seen corresponding path program 1 times [2022-11-15 22:19:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:01,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035834768] [2022-11-15 22:19:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035834768] [2022-11-15 22:19:01,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035834768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:01,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:01,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 22:19:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391511281] [2022-11-15 22:19:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:01,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 22:19:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 22:19:01,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 22:19:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:01,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:01,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-15 22:19:01,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-15 22:19:01,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-15 22:19:01,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-15 22:19:01,632 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-15 22:19:01,632 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-15 22:19:01,634 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:01,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 22:19:01,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:01,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 22:19:01,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-15 22:19:01,667 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 22:19:01,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-15 22:19:01,668 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3312a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:01,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 22:19:01,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1016299182, now seen corresponding path program 1 times [2022-11-15 22:19:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:01,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354826656] [2022-11-15 22:19:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:01,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354826656] [2022-11-15 22:19:01,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354826656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:01,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:01,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 22:19:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793530420] [2022-11-15 22:19:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 22:19:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 22:19:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 22:19:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:01,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:01,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-15 22:19:01,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 865717682, now seen corresponding path program 1 times [2022-11-15 22:19:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:01,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390289625] [2022-11-15 22:19:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:01,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390289625] [2022-11-15 22:19:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390289625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:01,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923045285] [2022-11-15 22:19:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:01,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:01,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,799 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:01,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:01,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-15 22:19:01,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 175238391, now seen corresponding path program 1 times [2022-11-15 22:19:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:01,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533073313] [2022-11-15 22:19:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533073313] [2022-11-15 22:19:01,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533073313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:01,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:01,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983094697] [2022-11-15 22:19:01,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:01,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:01,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:01,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:01,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:01,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:01,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-15 22:19:01,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 410754009, now seen corresponding path program 1 times [2022-11-15 22:19:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:01,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711264120] [2022-11-15 22:19:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711264120] [2022-11-15 22:19:02,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711264120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:02,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:02,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-15 22:19:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587628963] [2022-11-15 22:19:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:02,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 22:19:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 22:19:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 22:19:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:02,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-15 22:19:02,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -397114776, now seen corresponding path program 1 times [2022-11-15 22:19:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:02,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967664780] [2022-11-15 22:19:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967664780] [2022-11-15 22:19:02,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967664780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:02,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:02,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-15 22:19:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119403482] [2022-11-15 22:19:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:02,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-15 22:19:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-15 22:19:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-15 22:19:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:02,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.866666666666667) internal successors, (193), 15 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:02,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:02,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:02,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:02,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:03,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-15 22:19:03,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1524363427, now seen corresponding path program 1 times [2022-11-15 22:19:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543623060] [2022-11-15 22:19:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:05,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:05,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543623060] [2022-11-15 22:19:05,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543623060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:05,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:05,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-11-15 22:19:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540375459] [2022-11-15 22:19:05,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:05,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-15 22:19:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:05,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-15 22:19:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-11-15 22:19:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:05,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.793103448275862) internal successors, (197), 29 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:05,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:06,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-15 22:19:06,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1415853467, now seen corresponding path program 1 times [2022-11-15 22:19:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:06,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309736822] [2022-11-15 22:19:06,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 22:19:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:07,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309736822] [2022-11-15 22:19:07,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309736822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:07,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:07,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-15 22:19:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343207530] [2022-11-15 22:19:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-15 22:19:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-15 22:19:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-11-15 22:19:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:07,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.736842105263158) internal successors, (204), 19 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:07,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:07,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:07,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:07,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:07,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:07,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:07,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 22:19:07,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-15 22:19:07,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash 760148315, now seen corresponding path program 1 times [2022-11-15 22:19:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:07,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264386935] [2022-11-15 22:19:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 22:19:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:09,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264386935] [2022-11-15 22:19:09,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264386935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:09,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:09,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-11-15 22:19:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417596743] [2022-11-15 22:19:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:09,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-15 22:19:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-15 22:19:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-11-15 22:19:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:09,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 22:19:09,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 22:19:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-15 22:19:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-15 22:19:11,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1370509802, now seen corresponding path program 1 times [2022-11-15 22:19:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:11,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930699301] [2022-11-15 22:19:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 22:19:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930699301] [2022-11-15 22:19:14,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930699301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429515095] [2022-11-15 22:19:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:14,688 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-11-15 22:19:14,688 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-11-15 22:19:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:14,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-15 22:19:14,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:15,042 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-15 22:19:15,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-15 22:19:15,110 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-15 22:19:15,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-15 22:19:15,325 INFO L350 Elim1Store]: Elim1 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-11-15 22:19:15,399 INFO L350 Elim1Store]: Elim1 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-11-15 22:19:15,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-15 22:19:16,100 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 29 [2022-11-15 22:19:16,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:16,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:19:16,773 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 22:19:16,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-15 22:19:16,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:16,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:16,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-15 22:19:17,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-15 22:19:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:17,112 INFO L350 Elim1Store]: Elim1 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-11-15 22:19:17,720 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-15 22:19:17,720 INFO L350 Elim1Store]: Elim1 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 34 [2022-11-15 22:19:17,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:19:17,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:18,005 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-15 22:19:18,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56 [2022-11-15 22:19:18,267 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 26 [2022-11-15 22:19:18,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:18,388 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 26 [2022-11-15 22:19:18,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:18,887 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-15 22:19:18,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2022-11-15 22:19:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:19,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 40 treesize of output 34 [2022-11-15 22:19:19,129 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-15 22:19:19,130 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2022-11-15 22:19:19,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-15 22:19:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:19,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:21,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse2 |c_~#queue~0.base| (store (store (store (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0))))) is different from false [2022-11-15 22:19:22,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse2 |c_~#queue~0.base| (store (store (store (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0))))) is different from false [2022-11-15 22:19:22,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_751) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse2 |c_~#queue~0.base| (store (store (store (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))) is different from false [2022-11-15 22:19:22,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_749) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_751) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse2 |c_~#queue~0.base| (store (store (store (select .cse2 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0))))) is different from false [2022-11-15 22:19:22,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_749) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_751) .cse1 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse4 |c_~#queue~0.base| (store (store (store (select .cse4 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2022-11-15 22:19:22,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_749) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_751) .cse2 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse4 |c_~#queue~0.base| (store (store (store (select .cse4 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) (+ |c_~#queue~0.offset| 3204) v_ArrVal_759))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse1 .cse2))) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-11-15 22:19:22,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse3 (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse5 v_ArrVal_751) .cse2 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse4 |c_~#queue~0.base| (store (store (store (select .cse4 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_758) .cse2 v_ArrVal_759)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse1 .cse2))) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2022-11-15 22:19:22,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse3 (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse5 v_ArrVal_751) .cse2 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse4 |c_~#queue~0.base| (store (store (store (select .cse4 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_758) .cse2 v_ArrVal_759)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* |c_t2Thread1of1ForFork1_#t~post57#1| 4) 4 |~#stored_elements~0.offset|)) 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse1 .cse2))) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2022-11-15 22:19:23,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse5 v_ArrVal_751) .cse1 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse4 |c_~#queue~0.base| (store (store (store (select .cse4 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_758) .cse1 v_ArrVal_759)))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) 4 |~#stored_elements~0.offset|)) 0)) (not (= (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2022-11-15 22:19:23,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse6 v_ArrVal_751) .cse1 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse6 v_ArrVal_758) .cse1 v_ArrVal_759)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) .cse3) 0)) (not (= (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2022-11-15 22:19:23,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_747))) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse6 v_ArrVal_751) .cse1 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse6 v_ArrVal_758) .cse1 v_ArrVal_759)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) .cse3) 0)) (not (= (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))))))) is different from false [2022-11-15 22:19:23,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_747))) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|)) (.cse1 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse4 (let ((.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse6 v_ArrVal_751) .cse2 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse6 v_ArrVal_758) .cse2 v_ArrVal_759)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse1 .cse2))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) .cse3) 0))))))) is different from false [2022-11-15 22:19:24,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_759 Int) (v_ArrVal_758 Int) (v_ArrVal_745 Int) (v_ArrVal_752 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_745)))) (let ((.cse10 (store (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_747))) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|)) (.cse3 (select .cse10 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse7 (let ((.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_749) .cse9 v_ArrVal_751) .cse4 v_ArrVal_752)) |c_~#stored_elements~0.base| v_ArrVal_754))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_758) .cse4 v_ArrVal_759)))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|)))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_765) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse2) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse3 .cse4))) (not (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse4) (select .cse5 .cse2)))))))))) is different from false [2022-11-15 22:19:24,758 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-15 22:19:24,758 INFO L350 Elim1Store]: Elim1 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 5 case distinctions, treesize of input 2341 treesize of output 1978 [2022-11-15 22:19:24,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:19:24,862 INFO L350 Elim1Store]: Elim1 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 3343 treesize of output 3273 [2022-11-15 22:19:24,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1455 treesize of output 1423 [2022-11-15 22:19:24,903 INFO L350 Elim1Store]: Elim1 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 1688 treesize of output 1608 [2022-11-15 22:19:24,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1810 treesize of output 1794 [2022-11-15 22:19:24,947 INFO L350 Elim1Store]: Elim1 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 502 treesize of output 438 [2022-11-15 22:19:25,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-15 22:19:25,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:19:25,320 INFO L350 Elim1Store]: Elim1 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 129 treesize of output 119 [2022-11-15 22:19:26,129 INFO L321 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2022-11-15 22:19:26,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 109 [2022-11-15 22:19:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-15 22:19:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429515095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:26,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 46, 47] total 125 [2022-11-15 22:19:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332983655] [2022-11-15 22:19:26,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:26,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-15 22:19:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-15 22:19:26,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=802, Invalid=11613, Unknown=69, NotChecked=3016, Total=15500 [2022-11-15 22:19:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:26,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:26,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 4.672) internal successors, (584), 125 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 22:19:26,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-15 22:19:26,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 22:19:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-15 22:19:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-15 22:19:32,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-15 22:19:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:33,091 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1463679625, now seen corresponding path program 1 times [2022-11-15 22:19:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834393724] [2022-11-15 22:19:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-15 22:19:33,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-15 22:19:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-15 22:19:33,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-15 22:19:33,278 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-15 22:19:33,280 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-15 22:19:33,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-15 22:19:33,281 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-15 22:19:33,281 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2022-11-15 22:19:33,283 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 22:19:33,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 22:19:33,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:19:33 BasicIcfg [2022-11-15 22:19:33,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 22:19:33,421 INFO L158 Benchmark]: Toolchain (without parser) took 50994.25ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 131.8MB in the beginning and 521.8MB in the end (delta: -390.0MB). Peak memory consumption was 633.2MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,421 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 22:19:33,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.92ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 131.6MB in the beginning and 156.6MB in the end (delta: -25.1MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.70ms. Allocated memory is still 207.6MB. Free memory was 156.1MB in the beginning and 153.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,424 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 207.6MB. Free memory was 153.5MB in the beginning and 150.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,424 INFO L158 Benchmark]: RCFGBuilder took 530.73ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 127.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,424 INFO L158 Benchmark]: TraceAbstraction took 49919.15ms. Allocated memory was 207.6MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 126.8MB in the beginning and 521.8MB in the end (delta: -395.0MB). Peak memory consumption was 583.8MB. Max. memory is 8.0GB. [2022-11-15 22:19:33,425 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.92ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 131.6MB in the beginning and 156.6MB in the end (delta: -25.1MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.70ms. Allocated memory is still 207.6MB. Free memory was 156.1MB in the beginning and 153.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 207.6MB. Free memory was 153.5MB in the beginning and 150.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 530.73ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 127.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 49919.15ms. Allocated memory was 207.6MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 126.8MB in the beginning and 521.8MB in the end (delta: -395.0MB). Peak memory consumption was 583.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18680, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 817, dependent conditional: 751, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17961, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 98, dependent conditional: 32, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17961, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 98, dependent conditional: 32, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 249, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 86, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 86, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11518, independent: 11426, independent conditional: 12, independent unconditional: 11414, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11518, independent: 11410, independent conditional: 0, independent unconditional: 11410, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 108, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 96, independent conditional: 38, independent unconditional: 58, dependent: 163, dependent conditional: 51, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18252, independent: 6437, independent conditional: 30, independent unconditional: 6407, dependent: 297, dependent conditional: 60, dependent unconditional: 237, unknown: 11518, unknown conditional: 38, unknown unconditional: 11480] , Statistics on independence cache: Total cache size (in pairs): 11518, Positive cache size: 11426, Positive conditional cache size: 12, Positive unconditional cache size: 11414, Negative cache size: 92, Negative conditional cache size: 26, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 163, Maximal queried relation: 8, Independence queries for same thread: 719 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 918, Number of trivial persistent sets: 584, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12240, independent: 12174, independent conditional: 0, independent unconditional: 12174, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18680, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 817, dependent conditional: 751, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17961, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 98, dependent conditional: 32, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17961, independent: 17863, independent conditional: 5689, independent unconditional: 12174, dependent: 98, dependent conditional: 32, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 249, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 86, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18252, independent: 17863, independent conditional: 42, independent unconditional: 17821, dependent: 389, dependent conditional: 86, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11518, independent: 11426, independent conditional: 12, independent unconditional: 11414, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11518, independent: 11410, independent conditional: 0, independent unconditional: 11410, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 108, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 92, dependent conditional: 26, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 96, independent conditional: 38, independent unconditional: 58, dependent: 163, dependent conditional: 51, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18252, independent: 6437, independent conditional: 30, independent unconditional: 6407, dependent: 297, dependent conditional: 60, dependent unconditional: 237, unknown: 11518, unknown conditional: 38, unknown unconditional: 11480] , Statistics on independence cache: Total cache size (in pairs): 11518, Positive cache size: 11426, Positive conditional cache size: 12, Positive unconditional cache size: 11414, Negative cache size: 92, Negative conditional cache size: 26, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 163, Maximal queried relation: 8, Independence queries for same thread: 719 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8362, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 200, Number of trivial persistent sets: 172, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8205, independent: 8134, independent conditional: 0, independent unconditional: 8134, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8362, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16511, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 281, dependent conditional: 223, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16304, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16304, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 128, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 15, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 15, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12878, independent: 12817, independent conditional: 2, independent unconditional: 12815, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12878, independent: 12805, independent conditional: 0, independent unconditional: 12805, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 33, independent conditional: 2, independent unconditional: 31, dependent: 55, dependent conditional: 3, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16467, independent: 3413, independent conditional: 33, independent unconditional: 3380, dependent: 176, dependent conditional: 12, dependent unconditional: 164, unknown: 12878, unknown conditional: 5, unknown unconditional: 12873] , Statistics on independence cache: Total cache size (in pairs): 12878, Positive cache size: 12817, Positive conditional cache size: 2, Positive unconditional cache size: 12815, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 113, Maximal queried relation: 7, Independence queries for same thread: 207 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 415, Number of trivial persistent sets: 314, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13640, independent: 13582, independent conditional: 0, independent unconditional: 13582, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16511, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 281, dependent conditional: 223, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16304, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16304, independent: 16230, independent conditional: 2648, independent unconditional: 13582, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 128, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 15, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16467, independent: 16230, independent conditional: 35, independent unconditional: 16195, dependent: 237, dependent conditional: 15, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12878, independent: 12817, independent conditional: 2, independent unconditional: 12815, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12878, independent: 12805, independent conditional: 0, independent unconditional: 12805, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 33, independent conditional: 2, independent unconditional: 31, dependent: 55, dependent conditional: 3, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16467, independent: 3413, independent conditional: 33, independent unconditional: 3380, dependent: 176, dependent conditional: 12, dependent unconditional: 164, unknown: 12878, unknown conditional: 5, unknown unconditional: 12873] , Statistics on independence cache: Total cache size (in pairs): 12878, Positive cache size: 12817, Positive conditional cache size: 2, Positive unconditional cache size: 12815, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 113, Maximal queried relation: 7, Independence queries for same thread: 207 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [enqueue_flag=0] [L947] 0 pthread_mutex_t m; VAL [enqueue_flag=0, m={5:0}] [L951] 0 QType queue; VAL [enqueue_flag=0, m={5:0}, queue={6:0}] [L949] 0 int stored_elements[(800)]; VAL [enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={13:0}, id2={8:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1056] 0 dequeue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, empty(&queue)=-1, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=10, queue={6:0}, stored_elements={7:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=11, queue={6:0}, stored_elements={7:0}] [L1036] 2 int i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1064] 0 \read(id1) VAL [\read(id1)=10, dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={8:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L980] 1 q->element[q->tail] = x VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L981] EXPR 1 q->amount VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, queue={6:0}, stored_elements={7:0}, x=9] [L981] 1 q->amount++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, q->amount++=0, queue={6:0}, stored_elements={7:0}, x=9] [L982] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L988] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L988] 1 q->tail++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, q->tail++=0, queue={6:0}, stored_elements={7:0}, x=9] [L990] 1 return 0; VAL [\old(x)=9, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue(&queue,value)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1013] 1 stored_elements[0]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, empty(&queue)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1018] 1 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1018] COND TRUE 1 i<((800)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L980] 1 q->element[q->tail] = x VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L981] EXPR 1 q->amount VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=1] [L981] 1 q->amount++ VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=1] [L982] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L988] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L988] 1 q->tail++ VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, q->tail++=1, queue={6:0}, stored_elements={7:0}, x=1] [L990] 1 return 0; VAL [\old(x)=1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=1] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=9] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=9] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L997] COND FALSE 2 !(q->head == (800)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->head++=0, queue={6:0}, stored_elements={7:0}, x=9] [L1003] 2 return x; VAL [\result=9, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1043] 2 reach_error() VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 8.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1220 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1210 ConstructedInterpolants, 0 QuantifiedInterpolants, 13034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 58 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 9.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2046 NumberOfCodeBlocks, 2046 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2023 ConstructedInterpolants, 176 QuantifiedInterpolants, 60995 SizeOfPredicates, 52 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 13/24 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 proved your program to be incorrect! [2022-11-15 22:19:33,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2022-11-15 22:19:33,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2022-11-15 22:19:33,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-15 22:19:34,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...