/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 15:42:39,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 15:42:39,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 15:42:39,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 15:42:39,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 15:42:39,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 15:42:39,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 15:42:39,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 15:42:39,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 15:42:39,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 15:42:39,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 15:42:39,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 15:42:39,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 15:42:39,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 15:42:39,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 15:42:39,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 15:42:39,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 15:42:39,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 15:42:39,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 15:42:39,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 15:42:39,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 15:42:39,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 15:42:39,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 15:42:39,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 15:42:39,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 15:42:39,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 15:42:39,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 15:42:39,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 15:42:39,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 15:42:39,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 15:42:39,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 15:42:39,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 15:42:39,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 15:42:39,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 15:42:39,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 15:42:39,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 15:42:39,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 15:42:39,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 15:42:39,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 15:42:39,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 15:42:39,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 15:42:39,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 15:42:39,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 15:42:39,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 15:42:39,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 15:42:39,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 15:42:39,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 15:42:39,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 15:42:39,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 15:42:39,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 15:42:39,567 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 15:42:39,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 15:42:39,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 15:42:39,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 15:42:39,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:42:39,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 15:42:39,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 15:42:39,570 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-03-01 15:42:39,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 15:42:39,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 15:42:39,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 15:42:39,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 15:42:39,758 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 15:42:39,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-01 15:42:39,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb2bbc5d/1edeec30728543fbaab8e009cd07aa14/FLAG04ff35048 [2022-03-01 15:42:40,095 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 15:42:40,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-01 15:42:40,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb2bbc5d/1edeec30728543fbaab8e009cd07aa14/FLAG04ff35048 [2022-03-01 15:42:40,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb2bbc5d/1edeec30728543fbaab8e009cd07aa14 [2022-03-01 15:42:40,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 15:42:40,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 15:42:40,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 15:42:40,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 15:42:40,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 15:42:40,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ab1728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40, skipping insertion in model container [2022-03-01 15:42:40,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 15:42:40,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 15:42:40,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-01 15:42:40,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:42:40,765 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 15:42:40,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-01 15:42:40,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:42:40,809 INFO L208 MainTranslator]: Completed translation [2022-03-01 15:42:40,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40 WrapperNode [2022-03-01 15:42:40,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 15:42:40,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 15:42:40,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 15:42:40,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 15:42:40,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,858 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-03-01 15:42:40,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 15:42:40,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 15:42:40,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 15:42:40,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 15:42:40,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 15:42:40,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 15:42:40,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 15:42:40,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 15:42:40,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (1/1) ... [2022-03-01 15:42:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:42:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:42:40,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 15:42:40,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 15:42:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 15:42:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 15:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 15:42:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-01 15:42:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 15:42:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 15:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 15:42:40,963 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 15:42:41,046 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 15:42:41,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 15:42:41,314 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 15:42:41,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 15:42:41,472 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 15:42:41,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:42:41 BoogieIcfgContainer [2022-03-01 15:42:41,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 15:42:41,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 15:42:41,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 15:42:41,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 15:42:41,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 03:42:40" (1/3) ... [2022-03-01 15:42:41,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137bdab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:42:41, skipping insertion in model container [2022-03-01 15:42:41,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:42:40" (2/3) ... [2022-03-01 15:42:41,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137bdab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:42:41, skipping insertion in model container [2022-03-01 15:42:41,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:42:41" (3/3) ... [2022-03-01 15:42:41,495 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-03-01 15:42:41,499 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 15:42:41,499 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 15:42:41,499 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 15:42:41,499 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 15:42:41,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,584 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,599 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,599 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,607 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,608 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,608 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,608 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,608 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,608 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,609 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,610 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,611 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,612 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,615 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,620 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,626 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,636 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,636 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,638 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:42:41,648 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-03-01 15:42:41,677 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 15:42:41,681 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 15:42:41,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-01 15:42:41,691 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 204 places, 205 transitions, 454 flow [2022-03-01 15:42:42,383 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-01 15:42:42,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:42,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:42,600 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1525994273, now seen corresponding path program 1 times [2022-03-01 15:42:42,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:42,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961735096] [2022-03-01 15:42:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:42,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:42,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961735096] [2022-03-01 15:42:42,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961735096] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:42:42,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:42:42,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 15:42:42,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803017053] [2022-03-01 15:42:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:42:42,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 15:42:42,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 15:42:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:42:42,954 INFO L87 Difference]: Start difference. First operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:43,342 INFO L93 Difference]: Finished difference Result 19453 states and 81672 transitions. [2022-03-01 15:42:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 15:42:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-03-01 15:42:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:43,509 INFO L225 Difference]: With dead ends: 19453 [2022-03-01 15:42:43,509 INFO L226 Difference]: Without dead ends: 19449 [2022-03-01 15:42:43,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:42:43,515 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:43,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:42:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2022-03-01 15:42:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2022-03-01 15:42:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 4.199300699300699) internal successors, (81668), 19448 states have internal predecessors, (81668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 81668 transitions. [2022-03-01 15:42:44,450 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 81668 transitions. Word has length 145 [2022-03-01 15:42:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:44,451 INFO L470 AbstractCegarLoop]: Abstraction has 19449 states and 81668 transitions. [2022-03-01 15:42:44,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 81668 transitions. [2022-03-01 15:42:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-01 15:42:44,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:44,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:44,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 15:42:44,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 642202131, now seen corresponding path program 1 times [2022-03-01 15:42:44,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:44,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646410542] [2022-03-01 15:42:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:44,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:44,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646410542] [2022-03-01 15:42:44,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646410542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:42:44,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:42:44,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:42:44,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34388871] [2022-03-01 15:42:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:42:44,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:42:44,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:44,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:42:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:42:44,830 INFO L87 Difference]: Start difference. First operand 19449 states and 81668 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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-03-01 15:42:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:45,662 INFO L93 Difference]: Finished difference Result 53531 states and 227422 transitions. [2022-03-01 15:42:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 15:42:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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) Word has length 148 [2022-03-01 15:42:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:46,207 INFO L225 Difference]: With dead ends: 53531 [2022-03-01 15:42:46,212 INFO L226 Difference]: Without dead ends: 51050 [2022-03-01 15:42:46,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:42:46,214 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 127 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:46,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 845 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:42:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51050 states. [2022-03-01 15:42:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51050 to 24095. [2022-03-01 15:42:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24095 states, 24094 states have (on average 4.160164356271271) internal successors, (100235), 24094 states have internal predecessors, (100235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24095 states to 24095 states and 100235 transitions. [2022-03-01 15:42:47,616 INFO L78 Accepts]: Start accepts. Automaton has 24095 states and 100235 transitions. Word has length 148 [2022-03-01 15:42:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:47,620 INFO L470 AbstractCegarLoop]: Abstraction has 24095 states and 100235 transitions. [2022-03-01 15:42:47,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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-03-01 15:42:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 24095 states and 100235 transitions. [2022-03-01 15:42:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-01 15:42:47,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:47,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:47,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 15:42:47,711 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 361817829, now seen corresponding path program 2 times [2022-03-01 15:42:47,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:47,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771220539] [2022-03-01 15:42:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:47,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:47,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771220539] [2022-03-01 15:42:47,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771220539] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:42:47,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:42:47,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:42:47,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7205940] [2022-03-01 15:42:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:42:47,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:42:47,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:42:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:42:47,861 INFO L87 Difference]: Start difference. First operand 24095 states and 100235 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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-03-01 15:42:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:48,653 INFO L93 Difference]: Finished difference Result 54200 states and 230333 transitions. [2022-03-01 15:42:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 15:42:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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) Word has length 148 [2022-03-01 15:42:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:48,944 INFO L225 Difference]: With dead ends: 54200 [2022-03-01 15:42:48,944 INFO L226 Difference]: Without dead ends: 51719 [2022-03-01 15:42:48,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:42:48,945 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 118 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:48,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 986 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:42:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51719 states. [2022-03-01 15:42:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51719 to 24167. [2022-03-01 15:42:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24167 states, 24166 states have (on average 4.15596292311512) internal successors, (100433), 24166 states have internal predecessors, (100433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 100433 transitions. [2022-03-01 15:42:50,422 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 100433 transitions. Word has length 148 [2022-03-01 15:42:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:50,423 INFO L470 AbstractCegarLoop]: Abstraction has 24167 states and 100433 transitions. [2022-03-01 15:42:50,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 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-03-01 15:42:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 100433 transitions. [2022-03-01 15:42:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 15:42:50,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:50,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:50,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 15:42:50,502 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1229862456, now seen corresponding path program 1 times [2022-03-01 15:42:50,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:50,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334279368] [2022-03-01 15:42:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:50,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:50,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334279368] [2022-03-01 15:42:50,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334279368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:42:50,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:42:50,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 15:42:50,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803298206] [2022-03-01 15:42:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:42:50,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:42:50,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:42:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:42:50,622 INFO L87 Difference]: Start difference. First operand 24167 states and 100433 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:51,165 INFO L93 Difference]: Finished difference Result 46408 states and 191388 transitions. [2022-03-01 15:42:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:42:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-03-01 15:42:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:51,322 INFO L225 Difference]: With dead ends: 46408 [2022-03-01 15:42:51,323 INFO L226 Difference]: Without dead ends: 41314 [2022-03-01 15:42:51,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-01 15:42:51,325 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 579 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:51,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 633 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:42:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41314 states. [2022-03-01 15:42:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41314 to 31225. [2022-03-01 15:42:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 31224 states have (on average 4.112477581347681) internal successors, (128408), 31224 states have internal predecessors, (128408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 128408 transitions. [2022-03-01 15:42:52,500 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 128408 transitions. Word has length 152 [2022-03-01 15:42:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:52,500 INFO L470 AbstractCegarLoop]: Abstraction has 31225 states and 128408 transitions. [2022-03-01 15:42:52,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 128408 transitions. [2022-03-01 15:42:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 15:42:52,585 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:52,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:52,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 15:42:52,585 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 925961272, now seen corresponding path program 1 times [2022-03-01 15:42:52,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:52,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583323412] [2022-03-01 15:42:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:52,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:52,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583323412] [2022-03-01 15:42:52,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583323412] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:42:52,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:42:52,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 15:42:52,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850927637] [2022-03-01 15:42:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:42:52,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:42:52,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:42:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:42:52,897 INFO L87 Difference]: Start difference. First operand 31225 states and 128408 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:53,208 INFO L93 Difference]: Finished difference Result 31662 states and 126747 transitions. [2022-03-01 15:42:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:42:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-03-01 15:42:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:53,295 INFO L225 Difference]: With dead ends: 31662 [2022-03-01 15:42:53,296 INFO L226 Difference]: Without dead ends: 20789 [2022-03-01 15:42:53,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-01 15:42:53,299 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 524 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:53,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 645 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:42:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2022-03-01 15:42:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 20784. [2022-03-01 15:42:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20784 states, 20783 states have (on average 4.053264687484964) internal successors, (84239), 20783 states have internal predecessors, (84239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20784 states to 20784 states and 84239 transitions. [2022-03-01 15:42:54,024 INFO L78 Accepts]: Start accepts. Automaton has 20784 states and 84239 transitions. Word has length 152 [2022-03-01 15:42:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:54,024 INFO L470 AbstractCegarLoop]: Abstraction has 20784 states and 84239 transitions. [2022-03-01 15:42:54,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20784 states and 84239 transitions. [2022-03-01 15:42:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-01 15:42:54,211 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:54,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:54,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 15:42:54,212 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:54,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash -635863114, now seen corresponding path program 1 times [2022-03-01 15:42:54,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:54,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225398862] [2022-03-01 15:42:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:54,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:54,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225398862] [2022-03-01 15:42:54,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225398862] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:42:54,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252427060] [2022-03-01 15:42:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:54,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:42:54,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:42:54,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:42:54,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 15:42:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:54,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 15:42:54,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:42:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:54,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:42:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:55,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252427060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:42:55,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:42:55,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-01 15:42:55,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940898432] [2022-03-01 15:42:55,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:42:55,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 15:42:55,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 15:42:55,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-03-01 15:42:55,050 INFO L87 Difference]: Start difference. First operand 20784 states and 84239 transitions. Second operand 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-03-01 15:42:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:55,669 INFO L93 Difference]: Finished difference Result 39863 states and 160291 transitions. [2022-03-01 15:42:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 15:42:55,669 INFO L78 Accepts]: Start accepts. 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) Word has length 159 [2022-03-01 15:42:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:55,812 INFO L225 Difference]: With dead ends: 39863 [2022-03-01 15:42:55,812 INFO L226 Difference]: Without dead ends: 34571 [2022-03-01 15:42:55,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:42:55,813 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1080 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:55,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1080 Valid, 1710 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 15:42:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34571 states. [2022-03-01 15:42:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34571 to 26462. [2022-03-01 15:42:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26462 states, 26461 states have (on average 4.016930577075696) internal successors, (106292), 26461 states have internal predecessors, (106292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26462 states to 26462 states and 106292 transitions. [2022-03-01 15:42:56,591 INFO L78 Accepts]: Start accepts. Automaton has 26462 states and 106292 transitions. Word has length 159 [2022-03-01 15:42:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:56,591 INFO L470 AbstractCegarLoop]: Abstraction has 26462 states and 106292 transitions. [2022-03-01 15:42:56,592 INFO L471 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-03-01 15:42:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26462 states and 106292 transitions. [2022-03-01 15:42:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-01 15:42:56,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:56,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:56,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-01 15:42:56,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-01 15:42:56,864 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -221543642, now seen corresponding path program 1 times [2022-03-01 15:42:56,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:56,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510499296] [2022-03-01 15:42:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:56,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:56,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510499296] [2022-03-01 15:42:56,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510499296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:42:56,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123154098] [2022-03-01 15:42:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:42:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:42:57,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:42:57,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 15:42:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:57,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 15:42:57,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:42:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:57,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:42:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:42:57,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123154098] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:42:57,909 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:42:57,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-01 15:42:57,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098842211] [2022-03-01 15:42:57,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:42:57,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 15:42:57,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:42:57,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 15:42:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-03-01 15:42:57,910 INFO L87 Difference]: Start difference. First operand 26462 states and 106292 transitions. Second operand has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:42:58,257 INFO L93 Difference]: Finished difference Result 24919 states and 99000 transitions. [2022-03-01 15:42:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 15:42:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-03-01 15:42:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:42:58,319 INFO L225 Difference]: With dead ends: 24919 [2022-03-01 15:42:58,320 INFO L226 Difference]: Without dead ends: 20796 [2022-03-01 15:42:58,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:42:58,320 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 813 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:42:58,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 1331 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:42:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2022-03-01 15:42:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20791. [2022-03-01 15:42:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20791 states, 20790 states have (on average 4.052236652236652) internal successors, (84246), 20790 states have internal predecessors, (84246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20791 states to 20791 states and 84246 transitions. [2022-03-01 15:42:58,915 INFO L78 Accepts]: Start accepts. Automaton has 20791 states and 84246 transitions. Word has length 159 [2022-03-01 15:42:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:42:58,916 INFO L470 AbstractCegarLoop]: Abstraction has 20791 states and 84246 transitions. [2022-03-01 15:42:58,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:42:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 20791 states and 84246 transitions. [2022-03-01 15:42:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-03-01 15:42:58,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:42:58,959 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:42:58,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-01 15:42:59,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-01 15:42:59,189 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:42:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:42:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash 898509944, now seen corresponding path program 2 times [2022-03-01 15:42:59,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:42:59,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124863913] [2022-03-01 15:42:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:42:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:42:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:42:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:42:59,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:42:59,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124863913] [2022-03-01 15:42:59,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124863913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:42:59,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490100374] [2022-03-01 15:42:59,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:42:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:42:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:42:59,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:42:59,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 15:42:59,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:42:59,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:42:59,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 15:42:59,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:42:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:42:59,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:43:00,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490100374] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:00,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:43:00,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-03-01 15:43:00,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534810925] [2022-03-01 15:43:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:43:00,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:43:00,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:43:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-01 15:43:00,345 INFO L87 Difference]: Start difference. First operand 20791 states and 84246 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:00,652 INFO L93 Difference]: Finished difference Result 24097 states and 99434 transitions. [2022-03-01 15:43:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 15:43:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-03-01 15:43:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:00,728 INFO L225 Difference]: With dead ends: 24097 [2022-03-01 15:43:00,729 INFO L226 Difference]: Without dead ends: 23297 [2022-03-01 15:43:00,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:43:00,730 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 594 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:00,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 535 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:43:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23297 states. [2022-03-01 15:43:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23297 to 18721. [2022-03-01 15:43:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 18720 states have (on average 4.096581196581196) internal successors, (76688), 18720 states have internal predecessors, (76688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 76688 transitions. [2022-03-01 15:43:01,283 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 76688 transitions. Word has length 166 [2022-03-01 15:43:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:01,283 INFO L470 AbstractCegarLoop]: Abstraction has 18721 states and 76688 transitions. [2022-03-01 15:43:01,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 76688 transitions. [2022-03-01 15:43:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-03-01 15:43:01,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:01,320 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:01,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:01,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:01,529 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1312829416, now seen corresponding path program 2 times [2022-03-01 15:43:01,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:01,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417259815] [2022-03-01 15:43:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:43:01,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:01,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417259815] [2022-03-01 15:43:01,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417259815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:01,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072452187] [2022-03-01 15:43:01,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:43:01,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:01,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:01,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 15:43:01,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:43:01,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:01,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 15:43:01,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:43:02,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:43:02,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072452187] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:02,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:43:02,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-03-01 15:43:02,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003953098] [2022-03-01 15:43:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:43:02,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:43:02,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:43:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-01 15:43:02,363 INFO L87 Difference]: Start difference. First operand 18721 states and 76688 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:02,655 INFO L93 Difference]: Finished difference Result 26816 states and 110778 transitions. [2022-03-01 15:43:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 15:43:02,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-03-01 15:43:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:02,728 INFO L225 Difference]: With dead ends: 26816 [2022-03-01 15:43:02,729 INFO L226 Difference]: Without dead ends: 23578 [2022-03-01 15:43:02,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-01 15:43:02,731 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 556 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:02,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 563 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:43:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2022-03-01 15:43:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 20340. [2022-03-01 15:43:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20340 states, 20339 states have (on average 4.105708245243129) internal successors, (83506), 20339 states have internal predecessors, (83506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20340 states to 20340 states and 83506 transitions. [2022-03-01 15:43:03,321 INFO L78 Accepts]: Start accepts. Automaton has 20340 states and 83506 transitions. Word has length 166 [2022-03-01 15:43:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:03,322 INFO L470 AbstractCegarLoop]: Abstraction has 20340 states and 83506 transitions. [2022-03-01 15:43:03,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20340 states and 83506 transitions. [2022-03-01 15:43:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:03,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:03,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:03,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:03,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:03,700 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1031682445, now seen corresponding path program 1 times [2022-03-01 15:43:03,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:03,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798752712] [2022-03-01 15:43:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:04,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:04,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798752712] [2022-03-01 15:43:04,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798752712] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:04,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824835601] [2022-03-01 15:43:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:04,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:04,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 15:43:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:04,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-01 15:43:04,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:04,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:43:04,373 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:43:04,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:43:04,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:43:04,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:43:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:43:04,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:05,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-01 15:43:05,200 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-03-01 15:43:05,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:05,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2022-03-01 15:43:05,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-01 15:43:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-01 15:43:05,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824835601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:05,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:05,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 36 [2022-03-01 15:43:05,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931650767] [2022-03-01 15:43:05,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:05,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-01 15:43:05,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-01 15:43:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1022, Unknown=2, NotChecked=130, Total=1260 [2022-03-01 15:43:05,516 INFO L87 Difference]: Start difference. First operand 20340 states and 83506 transitions. Second operand has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:08,891 INFO L93 Difference]: Finished difference Result 113724 states and 478483 transitions. [2022-03-01 15:43:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-01 15:43:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:09,812 INFO L225 Difference]: With dead ends: 113724 [2022-03-01 15:43:09,813 INFO L226 Difference]: Without dead ends: 109642 [2022-03-01 15:43:09,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 318 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=678, Invalid=4298, Unknown=2, NotChecked=278, Total=5256 [2022-03-01 15:43:09,818 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 1714 mSDsluCounter, 8305 mSDsCounter, 0 mSdLazyCounter, 3185 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 7513 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1752 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:09,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 7513 Invalid, 5055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3185 Invalid, 0 Unknown, 1752 Unchecked, 1.3s Time] [2022-03-01 15:43:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109642 states. [2022-03-01 15:43:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109642 to 24341. [2022-03-01 15:43:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24341 states, 24340 states have (on average 4.058545603944125) internal successors, (98785), 24340 states have internal predecessors, (98785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24341 states to 24341 states and 98785 transitions. [2022-03-01 15:43:11,742 INFO L78 Accepts]: Start accepts. Automaton has 24341 states and 98785 transitions. Word has length 170 [2022-03-01 15:43:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:11,743 INFO L470 AbstractCegarLoop]: Abstraction has 24341 states and 98785 transitions. [2022-03-01 15:43:11,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24341 states and 98785 transitions. [2022-03-01 15:43:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:11,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:11,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:11,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:12,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-01 15:43:12,008 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 375242101, now seen corresponding path program 2 times [2022-03-01 15:43:12,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:12,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688483776] [2022-03-01 15:43:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:12,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:12,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:12,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688483776] [2022-03-01 15:43:12,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688483776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:12,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116762147] [2022-03-01 15:43:12,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:43:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:12,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:12,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 15:43:12,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:43:12,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:12,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-01 15:43:12,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:43:13,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:43:13,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:43:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:13,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:13,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_383) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-01 15:43:13,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array Int Int))) (= (+ c_~t_4~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_383) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-01 15:43:13,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:13,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2022-03-01 15:43:13,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-01 15:43:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-01 15:43:14,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116762147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:14,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:14,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-03-01 15:43:14,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320286445] [2022-03-01 15:43:14,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:14,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 15:43:14,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 15:43:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1229, Unknown=2, NotChecked=142, Total=1482 [2022-03-01 15:43:14,007 INFO L87 Difference]: Start difference. First operand 24341 states and 98785 transitions. Second operand has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:17,030 INFO L93 Difference]: Finished difference Result 80424 states and 337566 transitions. [2022-03-01 15:43:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 15:43:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:17,348 INFO L225 Difference]: With dead ends: 80424 [2022-03-01 15:43:17,349 INFO L226 Difference]: Without dead ends: 73962 [2022-03-01 15:43:17,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 315 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=830, Invalid=4288, Unknown=2, NotChecked=282, Total=5402 [2022-03-01 15:43:17,354 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 2635 mSDsluCounter, 6070 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2635 SdHoareTripleChecker+Valid, 5642 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1006 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:17,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2635 Valid, 5642 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2367 Invalid, 0 Unknown, 1006 Unchecked, 1.0s Time] [2022-03-01 15:43:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73962 states. [2022-03-01 15:43:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73962 to 26523. [2022-03-01 15:43:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26523 states, 26522 states have (on average 4.080159867279994) internal successors, (108214), 26522 states have internal predecessors, (108214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26523 states to 26523 states and 108214 transitions. [2022-03-01 15:43:18,736 INFO L78 Accepts]: Start accepts. Automaton has 26523 states and 108214 transitions. Word has length 170 [2022-03-01 15:43:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:18,736 INFO L470 AbstractCegarLoop]: Abstraction has 26523 states and 108214 transitions. [2022-03-01 15:43:18,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26523 states and 108214 transitions. [2022-03-01 15:43:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:18,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:18,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:18,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-01 15:43:18,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:19,000 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:19,000 INFO L85 PathProgramCache]: Analyzing trace with hash -731419125, now seen corresponding path program 3 times [2022-03-01 15:43:19,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:19,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935588924] [2022-03-01 15:43:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:19,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:19,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935588924] [2022-03-01 15:43:19,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935588924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:19,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106471374] [2022-03-01 15:43:19,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:43:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:19,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:19,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:19,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 15:43:19,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:43:19,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:19,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-01 15:43:19,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:19,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:43:19,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:43:20,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:43:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:20,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:20,767 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_432 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-01 15:43:20,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:20,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-03-01 15:43:20,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-01 15:43:20,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:43:20,823 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:20,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-03-01 15:43:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:21,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106471374] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:21,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:21,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-03-01 15:43:21,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929604398] [2022-03-01 15:43:21,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:21,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:43:21,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:43:21,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-03-01 15:43:21,239 INFO L87 Difference]: Start difference. First operand 26523 states and 108214 transitions. Second operand has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:23,613 INFO L93 Difference]: Finished difference Result 79719 states and 337347 transitions. [2022-03-01 15:43:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 15:43:23,614 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:24,154 INFO L225 Difference]: With dead ends: 79719 [2022-03-01 15:43:24,154 INFO L226 Difference]: Without dead ends: 77918 [2022-03-01 15:43:24,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 317 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=485, Invalid=3178, Unknown=1, NotChecked=118, Total=3782 [2022-03-01 15:43:24,155 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 1326 mSDsluCounter, 7551 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 6847 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:24,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 6847 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2255 Invalid, 0 Unknown, 561 Unchecked, 0.8s Time] [2022-03-01 15:43:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77918 states. [2022-03-01 15:43:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77918 to 26907. [2022-03-01 15:43:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26907 states, 26906 states have (on average 4.080353824425779) internal successors, (109786), 26906 states have internal predecessors, (109786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26907 states to 26907 states and 109786 transitions. [2022-03-01 15:43:25,713 INFO L78 Accepts]: Start accepts. Automaton has 26907 states and 109786 transitions. Word has length 170 [2022-03-01 15:43:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:25,713 INFO L470 AbstractCegarLoop]: Abstraction has 26907 states and 109786 transitions. [2022-03-01 15:43:25,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 26907 states and 109786 transitions. [2022-03-01 15:43:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:25,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:25,781 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:25,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:25,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:25,998 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1760866055, now seen corresponding path program 4 times [2022-03-01 15:43:25,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:25,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058896591] [2022-03-01 15:43:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:25,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:43:26,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:26,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058896591] [2022-03-01 15:43:26,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058896591] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:26,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596036940] [2022-03-01 15:43:26,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:43:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:26,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 15:43:26,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:43:26,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:26,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-01 15:43:26,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:26,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:43:26,736 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:43:26,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:43:27,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:43:27,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:43:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:43:27,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:27,484 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_482) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_482 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_482) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-01 15:43:27,511 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:27,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-03-01 15:43:27,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 15:43:27,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:43:27,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:43:27,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-03-01 15:43:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:28,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596036940] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:28,019 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:28,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 17] total 39 [2022-03-01 15:43:28,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088072147] [2022-03-01 15:43:28,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:28,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 15:43:28,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 15:43:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1285, Unknown=1, NotChecked=72, Total=1482 [2022-03-01 15:43:28,021 INFO L87 Difference]: Start difference. First operand 26907 states and 109786 transitions. Second operand has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:30,142 INFO L93 Difference]: Finished difference Result 50976 states and 212590 transitions. [2022-03-01 15:43:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 15:43:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:30,326 INFO L225 Difference]: With dead ends: 50976 [2022-03-01 15:43:30,326 INFO L226 Difference]: Without dead ends: 47595 [2022-03-01 15:43:30,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 323 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=766, Invalid=4067, Unknown=1, NotChecked=136, Total=4970 [2022-03-01 15:43:30,328 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 1458 mSDsluCounter, 5056 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:30,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1458 Valid, 4841 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2140 Invalid, 0 Unknown, 216 Unchecked, 0.8s Time] [2022-03-01 15:43:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47595 states. [2022-03-01 15:43:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47595 to 27387. [2022-03-01 15:43:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27387 states, 27386 states have (on average 4.085079967866793) internal successors, (111874), 27386 states have internal predecessors, (111874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27387 states to 27387 states and 111874 transitions. [2022-03-01 15:43:31,479 INFO L78 Accepts]: Start accepts. Automaton has 27387 states and 111874 transitions. Word has length 170 [2022-03-01 15:43:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:31,480 INFO L470 AbstractCegarLoop]: Abstraction has 27387 states and 111874 transitions. [2022-03-01 15:43:31,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27387 states and 111874 transitions. [2022-03-01 15:43:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:31,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:31,541 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:31,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:31,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-01 15:43:31,756 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -719236271, now seen corresponding path program 5 times [2022-03-01 15:43:31,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:31,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385932050] [2022-03-01 15:43:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:32,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:32,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385932050] [2022-03-01 15:43:32,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385932050] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:32,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661120422] [2022-03-01 15:43:32,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:43:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:32,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:32,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:32,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 15:43:32,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:43:32,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:32,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-01 15:43:32,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:32,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:43:32,335 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:43:32,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:43:32,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:43:32,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:43:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:32,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:33,014 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_532) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0))) (forall ((v_ArrVal_532 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_532) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-03-01 15:43:33,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:33,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2022-03-01 15:43:33,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 15:43:33,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:43:33,063 INFO L353 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-03-01 15:43:33,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2022-03-01 15:43:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:33,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661120422] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:33,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:33,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2022-03-01 15:43:33,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024242057] [2022-03-01 15:43:33,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:33,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-01 15:43:33,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:33,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-01 15:43:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2022-03-01 15:43:33,314 INFO L87 Difference]: Start difference. First operand 27387 states and 111874 transitions. Second operand has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:34,834 INFO L93 Difference]: Finished difference Result 52376 states and 219083 transitions. [2022-03-01 15:43:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 15:43:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:35,276 INFO L225 Difference]: With dead ends: 52376 [2022-03-01 15:43:35,277 INFO L226 Difference]: Without dead ends: 48515 [2022-03-01 15:43:35,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 323 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=2832, Unknown=1, NotChecked=114, Total=3540 [2022-03-01 15:43:35,278 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1486 mSDsluCounter, 3922 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:35,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 3764 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1413 Invalid, 0 Unknown, 338 Unchecked, 0.6s Time] [2022-03-01 15:43:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48515 states. [2022-03-01 15:43:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48515 to 27819. [2022-03-01 15:43:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27819 states, 27818 states have (on average 4.088216262851391) internal successors, (113726), 27818 states have internal predecessors, (113726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27819 states to 27819 states and 113726 transitions. [2022-03-01 15:43:36,347 INFO L78 Accepts]: Start accepts. Automaton has 27819 states and 113726 transitions. Word has length 170 [2022-03-01 15:43:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:36,347 INFO L470 AbstractCegarLoop]: Abstraction has 27819 states and 113726 transitions. [2022-03-01 15:43:36,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27819 states and 113726 transitions. [2022-03-01 15:43:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:36,409 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:36,409 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:36,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:36,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-01 15:43:36,628 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 250534987, now seen corresponding path program 6 times [2022-03-01 15:43:36,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:36,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155610245] [2022-03-01 15:43:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:36,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:36,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155610245] [2022-03-01 15:43:36,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155610245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:36,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062207421] [2022-03-01 15:43:36,927 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:43:36,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:36,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 15:43:37,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:43:37,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:37,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-01 15:43:37,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:38,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:43:38,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:43:38,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-01 15:43:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:43:38,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:38,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_581) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_581 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_581) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-03-01 15:43:38,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:38,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-03-01 15:43:38,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-01 15:43:38,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:43:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:43:38,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-03-01 15:43:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:43:39,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062207421] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:39,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:39,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 26] total 54 [2022-03-01 15:43:39,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708311802] [2022-03-01 15:43:39,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:39,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-01 15:43:39,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-01 15:43:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2513, Unknown=1, NotChecked=102, Total=2862 [2022-03-01 15:43:39,017 INFO L87 Difference]: Start difference. First operand 27819 states and 113726 transitions. Second operand has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:42,525 INFO L93 Difference]: Finished difference Result 115385 states and 481253 transitions. [2022-03-01 15:43:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:43:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:43,244 INFO L225 Difference]: With dead ends: 115385 [2022-03-01 15:43:43,245 INFO L226 Difference]: Without dead ends: 108623 [2022-03-01 15:43:43,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 300 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1606, Invalid=8297, Unknown=1, NotChecked=196, Total=10100 [2022-03-01 15:43:43,250 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 3925 mSDsluCounter, 6791 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3925 SdHoareTripleChecker+Valid, 6201 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:43,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3925 Valid, 6201 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2678 Invalid, 0 Unknown, 492 Unchecked, 1.0s Time] [2022-03-01 15:43:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108623 states. [2022-03-01 15:43:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108623 to 27435. [2022-03-01 15:43:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27435 states, 27434 states have (on average 4.08813880586134) internal successors, (112154), 27434 states have internal predecessors, (112154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27435 states to 27435 states and 112154 transitions. [2022-03-01 15:43:45,186 INFO L78 Accepts]: Start accepts. Automaton has 27435 states and 112154 transitions. Word has length 170 [2022-03-01 15:43:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:45,186 INFO L470 AbstractCegarLoop]: Abstraction has 27435 states and 112154 transitions. [2022-03-01 15:43:45,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27435 states and 112154 transitions. [2022-03-01 15:43:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:45,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:45,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:45,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:45,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-01 15:43:45,470 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1084604113, now seen corresponding path program 7 times [2022-03-01 15:43:45,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:45,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007127591] [2022-03-01 15:43:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:45,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:45,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007127591] [2022-03-01 15:43:45,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007127591] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:45,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712296561] [2022-03-01 15:43:45,673 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:43:45,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:45,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:45,674 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 15:43:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:43:45,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:46,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:43:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:43:46,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:46,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:46,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:43:46,818 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:43:46,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:43:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:47,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712296561] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:47,015 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:47,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 25 [2022-03-01 15:43:47,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072733355] [2022-03-01 15:43:47,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:47,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-01 15:43:47,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:47,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-01 15:43:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-03-01 15:43:47,017 INFO L87 Difference]: Start difference. First operand 27435 states and 112154 transitions. Second operand has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:48,463 INFO L93 Difference]: Finished difference Result 53180 states and 221733 transitions. [2022-03-01 15:43:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 15:43:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:48,673 INFO L225 Difference]: With dead ends: 53180 [2022-03-01 15:43:48,673 INFO L226 Difference]: Without dead ends: 49799 [2022-03-01 15:43:48,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1729, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 15:43:48,675 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 730 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:48,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 4440 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 15:43:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49799 states. [2022-03-01 15:43:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49799 to 28491. [2022-03-01 15:43:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28491 states, 28490 states have (on average 4.097086697086697) internal successors, (116726), 28490 states have internal predecessors, (116726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28491 states to 28491 states and 116726 transitions. [2022-03-01 15:43:49,680 INFO L78 Accepts]: Start accepts. Automaton has 28491 states and 116726 transitions. Word has length 170 [2022-03-01 15:43:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:49,680 INFO L470 AbstractCegarLoop]: Abstraction has 28491 states and 116726 transitions. [2022-03-01 15:43:49,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28491 states and 116726 transitions. [2022-03-01 15:43:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:49,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:49,948 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:49,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:50,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-01 15:43:50,157 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1652755541, now seen corresponding path program 8 times [2022-03-01 15:43:50,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:50,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73109927] [2022-03-01 15:43:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:50,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:50,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73109927] [2022-03-01 15:43:50,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73109927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:50,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275118304] [2022-03-01 15:43:50,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:43:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:50,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:50,425 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-01 15:43:50,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:43:50,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:50,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:43:50,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:50,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:43:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:50,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:51,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:51,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:43:51,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:51,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:43:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:51,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275118304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:51,339 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:51,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-03-01 15:43:51,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760370508] [2022-03-01 15:43:51,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:51,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 15:43:51,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:51,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 15:43:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-01 15:43:51,341 INFO L87 Difference]: Start difference. First operand 28491 states and 116726 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:52,447 INFO L93 Difference]: Finished difference Result 48879 states and 203472 transitions. [2022-03-01 15:43:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 15:43:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:52,622 INFO L225 Difference]: With dead ends: 48879 [2022-03-01 15:43:52,623 INFO L226 Difference]: Without dead ends: 45498 [2022-03-01 15:43:52,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 15:43:52,623 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 699 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:52,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 3049 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 873 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-03-01 15:43:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45498 states. [2022-03-01 15:43:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45498 to 28611. [2022-03-01 15:43:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28611 states, 28610 states have (on average 4.098147500873821) internal successors, (117248), 28610 states have internal predecessors, (117248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28611 states to 28611 states and 117248 transitions. [2022-03-01 15:43:53,714 INFO L78 Accepts]: Start accepts. Automaton has 28611 states and 117248 transitions. Word has length 170 [2022-03-01 15:43:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:53,714 INFO L470 AbstractCegarLoop]: Abstraction has 28611 states and 117248 transitions. [2022-03-01 15:43:53,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 28611 states and 117248 transitions. [2022-03-01 15:43:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:53,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:53,782 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:53,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:53,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-01 15:43:53,996 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1396512105, now seen corresponding path program 9 times [2022-03-01 15:43:53,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:53,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828698395] [2022-03-01 15:43:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:54,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:54,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828698395] [2022-03-01 15:43:54,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828698395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:54,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938945439] [2022-03-01 15:43:54,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:43:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:54,244 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:54,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-01 15:43:54,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:43:54,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:43:54,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:43:54,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:54,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:43:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:54,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:54,959 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:54,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:43:54,974 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:54,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:43:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:55,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938945439] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:55,157 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:55,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-03-01 15:43:55,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113975111] [2022-03-01 15:43:55,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:55,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 15:43:55,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 15:43:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-01 15:43:55,158 INFO L87 Difference]: Start difference. First operand 28611 states and 117248 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:55,957 INFO L93 Difference]: Finished difference Result 47808 states and 199029 transitions. [2022-03-01 15:43:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 15:43:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:56,120 INFO L225 Difference]: With dead ends: 47808 [2022-03-01 15:43:56,120 INFO L226 Difference]: Without dead ends: 47627 [2022-03-01 15:43:56,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 334 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 15:43:56,121 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 614 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:56,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 3053 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 816 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2022-03-01 15:43:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47627 states. [2022-03-01 15:43:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47627 to 32403. [2022-03-01 15:43:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32403 states, 32402 states have (on average 4.107524226899574) internal successors, (133092), 32402 states have internal predecessors, (133092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32403 states to 32403 states and 133092 transitions. [2022-03-01 15:43:57,219 INFO L78 Accepts]: Start accepts. Automaton has 32403 states and 133092 transitions. Word has length 170 [2022-03-01 15:43:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:43:57,219 INFO L470 AbstractCegarLoop]: Abstraction has 32403 states and 133092 transitions. [2022-03-01 15:43:57,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32403 states and 133092 transitions. [2022-03-01 15:43:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:43:57,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:43:57,290 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:43:57,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-01 15:43:57,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-01 15:43:57,504 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:43:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:43:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1805336330, now seen corresponding path program 1 times [2022-03-01 15:43:57,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:43:57,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108661432] [2022-03-01 15:43:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:43:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:57,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:43:57,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108661432] [2022-03-01 15:43:57,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108661432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:43:57,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693315595] [2022-03-01 15:43:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:43:57,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:43:57,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:43:57,701 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:43:57,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 15:43:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:43:57,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:43:57,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:43:58,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:43:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:43:58,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:43:58,418 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:43:58,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:43:58,430 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:43:58,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:43:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:43:58,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693315595] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:43:58,620 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:43:58,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-03-01 15:43:58,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651983397] [2022-03-01 15:43:58,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:43:58,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:43:58,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:43:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:43:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:43:58,621 INFO L87 Difference]: Start difference. First operand 32403 states and 133092 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:43:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:43:59,631 INFO L93 Difference]: Finished difference Result 52779 states and 219937 transitions. [2022-03-01 15:43:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:43:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:43:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:43:59,791 INFO L225 Difference]: With dead ends: 52779 [2022-03-01 15:43:59,791 INFO L226 Difference]: Without dead ends: 47298 [2022-03-01 15:43:59,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 15:43:59,792 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 661 mSDsluCounter, 4006 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 3821 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:43:59,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 3821 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 15:44:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47298 states. [2022-03-01 15:44:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47298 to 28131. [2022-03-01 15:44:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28131 states, 28130 states have (on average 4.093849982225382) internal successors, (115160), 28130 states have internal predecessors, (115160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28131 states to 28131 states and 115160 transitions. [2022-03-01 15:44:00,868 INFO L78 Accepts]: Start accepts. Automaton has 28131 states and 115160 transitions. Word has length 170 [2022-03-01 15:44:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:00,868 INFO L470 AbstractCegarLoop]: Abstraction has 28131 states and 115160 transitions. [2022-03-01 15:44:00,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28131 states and 115160 transitions. [2022-03-01 15:44:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:00,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:00,935 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:00,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:01,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:01,143 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 59627217, now seen corresponding path program 10 times [2022-03-01 15:44:01,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:01,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749827765] [2022-03-01 15:44:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:01,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:01,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749827765] [2022-03-01 15:44:01,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749827765] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:01,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160532387] [2022-03-01 15:44:01,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:44:01,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:01,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:01,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 15:44:01,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:44:01,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:01,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:44:01,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:01,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:44:01,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:02,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:02,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:44:02,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:02,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:02,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:44:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:02,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160532387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:02,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:02,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-03-01 15:44:02,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104857573] [2022-03-01 15:44:02,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:02,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:44:02,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:02,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:44:02,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:44:02,210 INFO L87 Difference]: Start difference. First operand 28131 states and 115160 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:03,365 INFO L93 Difference]: Finished difference Result 49455 states and 205944 transitions. [2022-03-01 15:44:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:44:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:03,521 INFO L225 Difference]: With dead ends: 49455 [2022-03-01 15:44:03,521 INFO L226 Difference]: Without dead ends: 46074 [2022-03-01 15:44:03,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 15:44:03,523 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 741 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:03,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 3514 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 15:44:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2022-03-01 15:44:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 28471. [2022-03-01 15:44:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28471 states, 28470 states have (on average 4.097330523357921) internal successors, (116651), 28470 states have internal predecessors, (116651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28471 states to 28471 states and 116651 transitions. [2022-03-01 15:44:04,617 INFO L78 Accepts]: Start accepts. Automaton has 28471 states and 116651 transitions. Word has length 170 [2022-03-01 15:44:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:04,617 INFO L470 AbstractCegarLoop]: Abstraction has 28471 states and 116651 transitions. [2022-03-01 15:44:04,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28471 states and 116651 transitions. [2022-03-01 15:44:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:04,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:04,685 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:04,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:04,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:04,902 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1305326867, now seen corresponding path program 11 times [2022-03-01 15:44:04,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:04,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406321220] [2022-03-01 15:44:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:05,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:05,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406321220] [2022-03-01 15:44:05,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406321220] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:05,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520687128] [2022-03-01 15:44:05,148 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:44:05,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:05,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:05,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:05,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-01 15:44:05,278 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:44:05,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:05,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-01 15:44:05,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:05,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:05,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 15:44:05,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:05,885 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:44:05,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:44:06,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:06,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:06,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:06,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:44:06,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:06,836 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ c_~s_2~0 (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) 1)))) (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse1 (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))))))) is different from false [2022-03-01 15:44:06,888 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ (select .cse0 (+ c_~X_0~0.offset 4)) 1)))) (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse1 (+ c_~X_0~0.offset 4)) (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))))) is different from false [2022-03-01 15:44:06,923 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_874) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse0 (+ c_~X_0~0.offset 4)) (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_874) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ (select .cse1 (+ c_~X_0~0.offset 4)) 1))))) is different from false [2022-03-01 15:44:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-01 15:44:07,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520687128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:07,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:07,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 13] total 42 [2022-03-01 15:44:07,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814066571] [2022-03-01 15:44:07,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:07,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-01 15:44:07,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:07,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-01 15:44:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1350, Unknown=3, NotChecked=228, Total=1722 [2022-03-01 15:44:07,038 INFO L87 Difference]: Start difference. First operand 28471 states and 116651 transitions. Second operand has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:09,217 INFO L93 Difference]: Finished difference Result 49413 states and 205998 transitions. [2022-03-01 15:44:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 15:44:09,218 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:09,384 INFO L225 Difference]: With dead ends: 49413 [2022-03-01 15:44:09,384 INFO L226 Difference]: Without dead ends: 45792 [2022-03-01 15:44:09,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 317 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=697, Invalid=4142, Unknown=3, NotChecked=414, Total=5256 [2022-03-01 15:44:09,386 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1709 mSDsluCounter, 5385 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:09,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 4916 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2468 Invalid, 0 Unknown, 1207 Unchecked, 0.8s Time] [2022-03-01 15:44:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45792 states. [2022-03-01 15:44:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45792 to 28703. [2022-03-01 15:44:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28703 states, 28702 states have (on average 4.099122012403317) internal successors, (117653), 28702 states have internal predecessors, (117653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28703 states to 28703 states and 117653 transitions. [2022-03-01 15:44:10,462 INFO L78 Accepts]: Start accepts. Automaton has 28703 states and 117653 transitions. Word has length 170 [2022-03-01 15:44:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:10,462 INFO L470 AbstractCegarLoop]: Abstraction has 28703 states and 117653 transitions. [2022-03-01 15:44:10,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 28703 states and 117653 transitions. [2022-03-01 15:44:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:10,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:10,525 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:10,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-01 15:44:10,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:10,739 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1227671575, now seen corresponding path program 12 times [2022-03-01 15:44:10,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:10,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140018726] [2022-03-01 15:44:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:10,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:10,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140018726] [2022-03-01 15:44:10,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140018726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:10,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417099886] [2022-03-01 15:44:10,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:44:10,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:10,935 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:10,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-01 15:44:11,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:44:11,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:11,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-01 15:44:11,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:11,529 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:11,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-03-01 15:44:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:44:11,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:11,991 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:11,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-03-01 15:44:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:44:12,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417099886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:12,890 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:12,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 38 [2022-03-01 15:44:12,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559965366] [2022-03-01 15:44:12,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:12,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:44:12,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:44:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 15:44:12,892 INFO L87 Difference]: Start difference. First operand 28703 states and 117653 transitions. Second operand has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:14,755 INFO L93 Difference]: Finished difference Result 65034 states and 272496 transitions. [2022-03-01 15:44:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 15:44:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:14,987 INFO L225 Difference]: With dead ends: 65034 [2022-03-01 15:44:14,987 INFO L226 Difference]: Without dead ends: 61413 [2022-03-01 15:44:14,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=794, Invalid=3898, Unknown=0, NotChecked=0, Total=4692 [2022-03-01 15:44:14,988 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1804 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:14,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 4644 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1752 Invalid, 0 Unknown, 233 Unchecked, 0.6s Time] [2022-03-01 15:44:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61413 states. [2022-03-01 15:44:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 30023. [2022-03-01 15:44:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30023 states, 30022 states have (on average 4.112550796082872) internal successors, (123467), 30022 states have internal predecessors, (123467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30023 states to 30023 states and 123467 transitions. [2022-03-01 15:44:16,200 INFO L78 Accepts]: Start accepts. Automaton has 30023 states and 123467 transitions. Word has length 170 [2022-03-01 15:44:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:16,200 INFO L470 AbstractCegarLoop]: Abstraction has 30023 states and 123467 transitions. [2022-03-01 15:44:16,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 30023 states and 123467 transitions. [2022-03-01 15:44:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:16,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:16,265 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:16,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:16,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:16,479 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1174380019, now seen corresponding path program 1 times [2022-03-01 15:44:16,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:16,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798758287] [2022-03-01 15:44:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:16,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:16,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798758287] [2022-03-01 15:44:16,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798758287] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:16,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432095970] [2022-03-01 15:44:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:16,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-01 15:44:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:16,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-01 15:44:16,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:16,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:17,027 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:44:17,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:44:17,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:44:17,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:44:17,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:17,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_974) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-03-01 15:44:17,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_974) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-03-01 15:44:17,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:17,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-03-01 15:44:17,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 15:44:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-01 15:44:18,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432095970] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:18,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:18,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 35 [2022-03-01 15:44:18,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200150098] [2022-03-01 15:44:18,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:18,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-01 15:44:18,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-01 15:44:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=958, Unknown=2, NotChecked=126, Total=1190 [2022-03-01 15:44:18,118 INFO L87 Difference]: Start difference. First operand 30023 states and 123467 transitions. Second operand has 35 states, 35 states have (on average 8.571428571428571) internal successors, (300), 35 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:20,767 INFO L93 Difference]: Finished difference Result 122541 states and 517737 transitions. [2022-03-01 15:44:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 15:44:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.571428571428571) internal successors, (300), 35 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:21,354 INFO L225 Difference]: With dead ends: 122541 [2022-03-01 15:44:21,355 INFO L226 Difference]: Without dead ends: 119520 [2022-03-01 15:44:21,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 320 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=475, Invalid=3437, Unknown=2, NotChecked=246, Total=4160 [2022-03-01 15:44:21,365 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 1730 mSDsluCounter, 6738 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 6132 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 860 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:21,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1730 Valid, 6132 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2721 Invalid, 0 Unknown, 860 Unchecked, 0.9s Time] [2022-03-01 15:44:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119520 states. [2022-03-01 15:44:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119520 to 30533. [2022-03-01 15:44:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30533 states, 30532 states have (on average 4.111096554434692) internal successors, (125520), 30532 states have internal predecessors, (125520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30533 states to 30533 states and 125520 transitions. [2022-03-01 15:44:23,723 INFO L78 Accepts]: Start accepts. Automaton has 30533 states and 125520 transitions. Word has length 170 [2022-03-01 15:44:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:23,743 INFO L470 AbstractCegarLoop]: Abstraction has 30533 states and 125520 transitions. [2022-03-01 15:44:23,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.571428571428571) internal successors, (300), 35 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30533 states and 125520 transitions. [2022-03-01 15:44:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:23,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:23,869 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:23,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:24,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:24,083 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1326940101, now seen corresponding path program 2 times [2022-03-01 15:44:24,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:24,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892056515] [2022-03-01 15:44:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:24,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:24,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892056515] [2022-03-01 15:44:24,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892056515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:24,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15711140] [2022-03-01 15:44:24,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:44:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:24,364 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:24,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-01 15:44:24,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:44:24,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:24,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 15:44:24,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:25,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:25,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:44:25,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-01 15:44:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:44:25,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:25,499 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1023 (Array Int Int))) (<= c_~s_2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1023 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ 1 c_~s_2~0)))) is different from false [2022-03-01 15:44:25,532 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1023 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 1 c_~s_2~0))) (forall ((v_ArrVal_1023 (Array Int Int))) (<= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-01 15:44:25,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:25,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-03-01 15:44:25,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 15:44:25,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:44:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:25,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-03-01 15:44:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-01 15:44:26,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15711140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:26,387 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:26,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 26] total 54 [2022-03-01 15:44:26,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26288376] [2022-03-01 15:44:26,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:26,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-01 15:44:26,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-01 15:44:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2425, Unknown=2, NotChecked=202, Total=2862 [2022-03-01 15:44:26,388 INFO L87 Difference]: Start difference. First operand 30533 states and 125520 transitions. Second operand has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:31,608 INFO L93 Difference]: Finished difference Result 140391 states and 587791 transitions. [2022-03-01 15:44:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-01 15:44:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:32,552 INFO L225 Difference]: With dead ends: 140391 [2022-03-01 15:44:32,553 INFO L226 Difference]: Without dead ends: 138069 [2022-03-01 15:44:32,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 302 SyntacticMatches, 9 SemanticMatches, 116 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2293, Invalid=11053, Unknown=2, NotChecked=458, Total=13806 [2022-03-01 15:44:32,554 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 4715 mSDsluCounter, 7882 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4715 SdHoareTripleChecker+Valid, 7165 SdHoareTripleChecker+Invalid, 5560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1771 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:32,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4715 Valid, 7165 Invalid, 5560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3532 Invalid, 0 Unknown, 1771 Unchecked, 1.4s Time] [2022-03-01 15:44:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138069 states. [2022-03-01 15:44:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138069 to 30533. [2022-03-01 15:44:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30533 states, 30532 states have (on average 4.111096554434692) internal successors, (125520), 30532 states have internal predecessors, (125520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30533 states to 30533 states and 125520 transitions. [2022-03-01 15:44:35,160 INFO L78 Accepts]: Start accepts. Automaton has 30533 states and 125520 transitions. Word has length 170 [2022-03-01 15:44:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:35,161 INFO L470 AbstractCegarLoop]: Abstraction has 30533 states and 125520 transitions. [2022-03-01 15:44:35,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 30533 states and 125520 transitions. [2022-03-01 15:44:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:35,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:35,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:35,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:35,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:35,455 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 537771213, now seen corresponding path program 3 times [2022-03-01 15:44:35,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:35,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925305317] [2022-03-01 15:44:35,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:35,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:35,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925305317] [2022-03-01 15:44:35,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925305317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:35,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037060843] [2022-03-01 15:44:35,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:44:35,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:35,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:35,701 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:35,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-01 15:44:35,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:44:35,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:35,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-01 15:44:35,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:36,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:44:36,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:36,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:36,639 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1072 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1072) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 c_~s_2~0))) (forall ((v_ArrVal_1072 (Array Int Int))) (< (+ c_~t_5~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1072) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-03-01 15:44:36,673 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:36,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2022-03-01 15:44:36,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 15:44:36,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:44:36,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:36,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-03-01 15:44:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:37,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037060843] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:37,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:37,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-03-01 15:44:37,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133694328] [2022-03-01 15:44:37,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:37,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:44:37,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:44:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1222, Unknown=1, NotChecked=70, Total=1406 [2022-03-01 15:44:37,057 INFO L87 Difference]: Start difference. First operand 30533 states and 125520 transitions. Second operand has 38 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:38,796 INFO L93 Difference]: Finished difference Result 51438 states and 216318 transitions. [2022-03-01 15:44:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 15:44:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:38,997 INFO L225 Difference]: With dead ends: 51438 [2022-03-01 15:44:38,997 INFO L226 Difference]: Without dead ends: 48117 [2022-03-01 15:44:38,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=546, Invalid=2879, Unknown=1, NotChecked=114, Total=3540 [2022-03-01 15:44:38,998 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1656 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:38,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 4244 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1616 Invalid, 0 Unknown, 414 Unchecked, 0.5s Time] [2022-03-01 15:44:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48117 states. [2022-03-01 15:44:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48117 to 31253. [2022-03-01 15:44:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31253 states, 31252 states have (on average 4.119928324587226) internal successors, (128756), 31252 states have internal predecessors, (128756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31253 states to 31253 states and 128756 transitions. [2022-03-01 15:44:40,136 INFO L78 Accepts]: Start accepts. Automaton has 31253 states and 128756 transitions. Word has length 170 [2022-03-01 15:44:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:40,136 INFO L470 AbstractCegarLoop]: Abstraction has 31253 states and 128756 transitions. [2022-03-01 15:44:40,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31253 states and 128756 transitions. [2022-03-01 15:44:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:40,211 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:40,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:40,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-01 15:44:40,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-01 15:44:40,430 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash -124003713, now seen corresponding path program 4 times [2022-03-01 15:44:40,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:40,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884708756] [2022-03-01 15:44:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:40,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:40,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884708756] [2022-03-01 15:44:40,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884708756] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:40,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032709619] [2022-03-01 15:44:40,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:44:40,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:40,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:40,956 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:40,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-01 15:44:41,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:44:41,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:41,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 15:44:41,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:41,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:41,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:44:41,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:44:41,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:41,682 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1121 (Array Int Int))) (<= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1121) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1121 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1121) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 1 c_~s_2~0)))) is different from false [2022-03-01 15:44:41,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:41,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-03-01 15:44:41,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-01 15:44:41,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:44:41,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:41,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-03-01 15:44:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:41,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032709619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:41,948 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:41,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 40 [2022-03-01 15:44:41,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429818692] [2022-03-01 15:44:41,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:41,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 15:44:41,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 15:44:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1365, Unknown=1, NotChecked=74, Total=1560 [2022-03-01 15:44:41,951 INFO L87 Difference]: Start difference. First operand 31253 states and 128756 transitions. Second operand has 40 states, 40 states have (on average 8.35) internal successors, (334), 40 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:43,796 INFO L93 Difference]: Finished difference Result 51545 states and 216658 transitions. [2022-03-01 15:44:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 15:44:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.35) internal successors, (334), 40 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:43,978 INFO L225 Difference]: With dead ends: 51545 [2022-03-01 15:44:43,978 INFO L226 Difference]: Without dead ends: 48524 [2022-03-01 15:44:43,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 314 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=553, Invalid=3356, Unknown=1, NotChecked=122, Total=4032 [2022-03-01 15:44:43,979 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1348 mSDsluCounter, 5364 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 4951 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:43,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1348 Valid, 4951 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2018 Invalid, 0 Unknown, 325 Unchecked, 0.6s Time] [2022-03-01 15:44:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48524 states. [2022-03-01 15:44:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48524 to 31253. [2022-03-01 15:44:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31253 states, 31252 states have (on average 4.119928324587226) internal successors, (128756), 31252 states have internal predecessors, (128756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31253 states to 31253 states and 128756 transitions. [2022-03-01 15:44:45,186 INFO L78 Accepts]: Start accepts. Automaton has 31253 states and 128756 transitions. Word has length 170 [2022-03-01 15:44:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:45,186 INFO L470 AbstractCegarLoop]: Abstraction has 31253 states and 128756 transitions. [2022-03-01 15:44:45,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.35) internal successors, (334), 40 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31253 states and 128756 transitions. [2022-03-01 15:44:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:45,260 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:45,260 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:45,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:45,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-01 15:44:45,478 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1482130641, now seen corresponding path program 5 times [2022-03-01 15:44:45,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:45,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115037819] [2022-03-01 15:44:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:45,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:45,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115037819] [2022-03-01 15:44:45,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115037819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:45,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794832304] [2022-03-01 15:44:45,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:44:45,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:45,754 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:45,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-01 15:44:45,903 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:44:45,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:45,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-01 15:44:45,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:45,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:44:46,017 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:44:46,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:44:46,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:44:46,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:44:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:46,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:46,959 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1171 (Array Int Int))) (<= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1171) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1171 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1171) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 1 c_~s_2~0)))) is different from false [2022-03-01 15:44:46,991 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:46,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-03-01 15:44:46,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-01 15:44:47,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:44:47,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:44:47,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-03-01 15:44:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:47,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794832304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:47,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:47,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-01 15:44:47,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758757785] [2022-03-01 15:44:47,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:47,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-01 15:44:47,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-01 15:44:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=958, Unknown=1, NotChecked=62, Total=1122 [2022-03-01 15:44:47,267 INFO L87 Difference]: Start difference. First operand 31253 states and 128756 transitions. Second operand has 34 states, 34 states have (on average 10.0) internal successors, (340), 34 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:48,983 INFO L93 Difference]: Finished difference Result 55166 states and 232345 transitions. [2022-03-01 15:44:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 15:44:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 10.0) internal successors, (340), 34 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:49,209 INFO L225 Difference]: With dead ends: 55166 [2022-03-01 15:44:49,210 INFO L226 Difference]: Without dead ends: 52145 [2022-03-01 15:44:49,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 321 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2894, Unknown=1, NotChecked=114, Total=3540 [2022-03-01 15:44:49,210 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1339 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4492 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 453 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:49,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 4492 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1948 Invalid, 0 Unknown, 453 Unchecked, 0.7s Time] [2022-03-01 15:44:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52145 states. [2022-03-01 15:44:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52145 to 31253. [2022-03-01 15:44:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31253 states, 31252 states have (on average 4.119928324587226) internal successors, (128756), 31252 states have internal predecessors, (128756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31253 states to 31253 states and 128756 transitions. [2022-03-01 15:44:50,479 INFO L78 Accepts]: Start accepts. Automaton has 31253 states and 128756 transitions. Word has length 170 [2022-03-01 15:44:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:50,482 INFO L470 AbstractCegarLoop]: Abstraction has 31253 states and 128756 transitions. [2022-03-01 15:44:50,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.0) internal successors, (340), 34 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 31253 states and 128756 transitions. [2022-03-01 15:44:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:50,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:50,556 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:50,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-01 15:44:50,767 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1211495441, now seen corresponding path program 6 times [2022-03-01 15:44:50,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:50,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802857095] [2022-03-01 15:44:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:50,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:50,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802857095] [2022-03-01 15:44:50,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802857095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:50,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477724426] [2022-03-01 15:44:50,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:44:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:50,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:50,966 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:50,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-01 15:44:51,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:44:51,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:44:51,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:44:51,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:51,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:44:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:51,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:51,675 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:51,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:44:51,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:51,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:44:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:51,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477724426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:51,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:51,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 23 [2022-03-01 15:44:51,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225186932] [2022-03-01 15:44:51,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:51,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 15:44:51,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 15:44:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-03-01 15:44:51,890 INFO L87 Difference]: Start difference. First operand 31253 states and 128756 transitions. Second operand has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:52,881 INFO L93 Difference]: Finished difference Result 50114 states and 209693 transitions. [2022-03-01 15:44:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 15:44:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:53,087 INFO L225 Difference]: With dead ends: 50114 [2022-03-01 15:44:53,088 INFO L226 Difference]: Without dead ends: 50053 [2022-03-01 15:44:53,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 15:44:53,088 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 619 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:53,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 3568 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1055 Invalid, 0 Unknown, 74 Unchecked, 0.4s Time] [2022-03-01 15:44:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50053 states. [2022-03-01 15:44:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50053 to 33597. [2022-03-01 15:44:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33597 states, 33596 states have (on average 4.122842005000595) internal successors, (138511), 33596 states have internal predecessors, (138511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 138511 transitions. [2022-03-01 15:44:54,346 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 138511 transitions. Word has length 170 [2022-03-01 15:44:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:54,346 INFO L470 AbstractCegarLoop]: Abstraction has 33597 states and 138511 transitions. [2022-03-01 15:44:54,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 138511 transitions. [2022-03-01 15:44:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:54,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:54,428 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:54,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-01 15:44:54,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:54,645 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1620319666, now seen corresponding path program 1 times [2022-03-01 15:44:54,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:54,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749419579] [2022-03-01 15:44:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:54,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:54,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749419579] [2022-03-01 15:44:54,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749419579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:54,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064166420] [2022-03-01 15:44:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:54,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:54,856 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:54,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-01 15:44:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:55,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:44:55,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:55,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:44:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:44:55,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:44:55,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:44:55,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:44:55,613 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:44:55,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:44:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:55,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064166420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:44:55,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:44:55,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 25 [2022-03-01 15:44:55,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471107348] [2022-03-01 15:44:55,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:44:55,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-01 15:44:55,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:44:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-01 15:44:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-03-01 15:44:55,962 INFO L87 Difference]: Start difference. First operand 33597 states and 138511 transitions. Second operand has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:44:57,109 INFO L93 Difference]: Finished difference Result 53057 states and 222322 transitions. [2022-03-01 15:44:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:44:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:44:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:44:57,530 INFO L225 Difference]: With dead ends: 53057 [2022-03-01 15:44:57,531 INFO L226 Difference]: Without dead ends: 49556 [2022-03-01 15:44:57,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 328 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1637, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 15:44:57,531 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 695 mSDsluCounter, 4380 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:44:57,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 4135 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 15:44:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49556 states. [2022-03-01 15:44:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49556 to 32733. [2022-03-01 15:44:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-03-01 15:44:58,670 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-03-01 15:44:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:44:58,671 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-03-01 15:44:58,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:44:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-03-01 15:44:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:44:58,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:44:58,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:44:58,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-01 15:44:58,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-01 15:44:58,967 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:44:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:44:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1945072053, now seen corresponding path program 7 times [2022-03-01 15:44:58,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:44:58,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060705828] [2022-03-01 15:44:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:44:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:44:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:44:59,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:44:59,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060705828] [2022-03-01 15:44:59,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060705828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:44:59,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086480200] [2022-03-01 15:44:59,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:44:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:44:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:44:59,156 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:44:59,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-01 15:44:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:44:59,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:44:59,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:44:59,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:45:00,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:00,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:00,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:45:00,155 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:45:00,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:45:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:00,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086480200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:00,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:00,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-03-01 15:45:00,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872504194] [2022-03-01 15:45:00,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:00,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:45:00,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:45:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:45:00,264 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:01,248 INFO L93 Difference]: Finished difference Result 50734 states and 213030 transitions. [2022-03-01 15:45:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:45:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:01,447 INFO L225 Difference]: With dead ends: 50734 [2022-03-01 15:45:01,447 INFO L226 Difference]: Without dead ends: 47413 [2022-03-01 15:45:01,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 15:45:01,448 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 700 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3552 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:01,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 3552 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 15:45:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47413 states. [2022-03-01 15:45:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47413 to 32841. [2022-03-01 15:45:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32841 states, 32840 states have (on average 4.125669914738125) internal successors, (135487), 32840 states have internal predecessors, (135487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32841 states to 32841 states and 135487 transitions. [2022-03-01 15:45:02,551 INFO L78 Accepts]: Start accepts. Automaton has 32841 states and 135487 transitions. Word has length 170 [2022-03-01 15:45:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:02,551 INFO L470 AbstractCegarLoop]: Abstraction has 32841 states and 135487 transitions. [2022-03-01 15:45:02,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32841 states and 135487 transitions. [2022-03-01 15:45:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:02,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:02,851 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:02,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:03,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:03,068 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 461003069, now seen corresponding path program 8 times [2022-03-01 15:45:03,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:03,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018121283] [2022-03-01 15:45:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:03,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:03,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018121283] [2022-03-01 15:45:03,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018121283] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:03,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115724538] [2022-03-01 15:45:03,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:45:03,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:03,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:03,300 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:03,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-01 15:45:03,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:45:03,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:03,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:45:03,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:03,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:03,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:03,909 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:03,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:45:03,921 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:03,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:45:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:04,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115724538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:04,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:04,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-03-01 15:45:04,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284851516] [2022-03-01 15:45:04,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:04,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 15:45:04,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 15:45:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-03-01 15:45:04,080 INFO L87 Difference]: Start difference. First operand 32841 states and 135487 transitions. Second operand has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:05,144 INFO L93 Difference]: Finished difference Result 50401 states and 211392 transitions. [2022-03-01 15:45:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 15:45:05,144 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:05,333 INFO L225 Difference]: With dead ends: 50401 [2022-03-01 15:45:05,333 INFO L226 Difference]: Without dead ends: 47380 [2022-03-01 15:45:05,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 15:45:05,333 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 626 mSDsluCounter, 3412 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:05,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 3258 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 999 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2022-03-01 15:45:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47380 states. [2022-03-01 15:45:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47380 to 32733. [2022-03-01 15:45:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-03-01 15:45:06,497 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-03-01 15:45:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:06,498 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-03-01 15:45:06,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-03-01 15:45:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:06,573 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:06,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:06,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:06,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-01 15:45:06,788 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1487976427, now seen corresponding path program 9 times [2022-03-01 15:45:06,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:06,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60517321] [2022-03-01 15:45:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:06,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:06,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60517321] [2022-03-01 15:45:06,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60517321] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:06,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300360861] [2022-03-01 15:45:06,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:45:06,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:06,966 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-01 15:45:07,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:45:07,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:07,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:45:07,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:07,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:07,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:07,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:07,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:45:07,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:07,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:45:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:07,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300360861] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:07,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:07,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-03-01 15:45:07,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748138782] [2022-03-01 15:45:07,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:07,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 15:45:07,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:07,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 15:45:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-01 15:45:07,866 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:08,789 INFO L93 Difference]: Finished difference Result 50914 states and 213893 transitions. [2022-03-01 15:45:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 15:45:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:08,969 INFO L225 Difference]: With dead ends: 50914 [2022-03-01 15:45:08,970 INFO L226 Difference]: Without dead ends: 47593 [2022-03-01 15:45:08,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 15:45:08,971 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 667 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:08,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 2709 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 820 Invalid, 0 Unknown, 27 Unchecked, 0.3s Time] [2022-03-01 15:45:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47593 states. [2022-03-01 15:45:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47593 to 33165. [2022-03-01 15:45:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33165 states, 33164 states have (on average 4.128874683391629) internal successors, (136930), 33164 states have internal predecessors, (136930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33165 states to 33165 states and 136930 transitions. [2022-03-01 15:45:10,314 INFO L78 Accepts]: Start accepts. Automaton has 33165 states and 136930 transitions. Word has length 170 [2022-03-01 15:45:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:10,314 INFO L470 AbstractCegarLoop]: Abstraction has 33165 states and 136930 transitions. [2022-03-01 15:45:10,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33165 states and 136930 transitions. [2022-03-01 15:45:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:10,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:10,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:10,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:10,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:10,608 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 3907443, now seen corresponding path program 10 times [2022-03-01 15:45:10,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:10,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571079519] [2022-03-01 15:45:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:10,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:10,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571079519] [2022-03-01 15:45:10,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571079519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:10,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472013557] [2022-03-01 15:45:10,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:45:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:10,868 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:10,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-01 15:45:11,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:45:11,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:11,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 15:45:11,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:11,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:45:11,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:11,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:11,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:45:11,609 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:45:11,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:45:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:11,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472013557] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:11,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:11,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-03-01 15:45:11,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257838059] [2022-03-01 15:45:11,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:11,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:45:11,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:45:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:45:11,745 INFO L87 Difference]: Start difference. First operand 33165 states and 136930 transitions. Second operand has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:12,700 INFO L93 Difference]: Finished difference Result 50733 states and 212921 transitions. [2022-03-01 15:45:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:45:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:12,865 INFO L225 Difference]: With dead ends: 50733 [2022-03-01 15:45:12,865 INFO L226 Difference]: Without dead ends: 47712 [2022-03-01 15:45:12,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 15:45:12,865 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 665 mSDsluCounter, 3831 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:12,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [665 Valid, 3619 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 15:45:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47712 states. [2022-03-01 15:45:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47712 to 33057. [2022-03-01 15:45:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33057 states, 33056 states have (on average 4.127813407550823) internal successors, (136449), 33056 states have internal predecessors, (136449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33057 states to 33057 states and 136449 transitions. [2022-03-01 15:45:14,170 INFO L78 Accepts]: Start accepts. Automaton has 33057 states and 136449 transitions. Word has length 170 [2022-03-01 15:45:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:14,170 INFO L470 AbstractCegarLoop]: Abstraction has 33057 states and 136449 transitions. [2022-03-01 15:45:14,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33057 states and 136449 transitions. [2022-03-01 15:45:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:14,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:14,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:14,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:14,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:14,475 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1891539375, now seen corresponding path program 11 times [2022-03-01 15:45:14,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:14,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089599986] [2022-03-01 15:45:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:14,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:14,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089599986] [2022-03-01 15:45:14,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089599986] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:14,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6722644] [2022-03-01 15:45:14,750 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:45:14,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:14,751 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:14,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-01 15:45:14,897 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:45:14,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:14,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-01 15:45:14,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:15,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:15,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:15,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:15,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:45:15,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:15,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-01 15:45:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:15,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6722644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:15,918 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:15,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 23 [2022-03-01 15:45:15,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768267715] [2022-03-01 15:45:15,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:15,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 15:45:15,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:15,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 15:45:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-03-01 15:45:15,920 INFO L87 Difference]: Start difference. First operand 33057 states and 136449 transitions. Second operand has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:17,097 INFO L93 Difference]: Finished difference Result 54246 states and 228127 transitions. [2022-03-01 15:45:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 15:45:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:17,333 INFO L225 Difference]: With dead ends: 54246 [2022-03-01 15:45:17,333 INFO L226 Difference]: Without dead ends: 51225 [2022-03-01 15:45:17,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 15:45:17,333 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 706 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:17,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 3152 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1089 Invalid, 0 Unknown, 29 Unchecked, 0.6s Time] [2022-03-01 15:45:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51225 states. [2022-03-01 15:45:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51225 to 32733. [2022-03-01 15:45:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-03-01 15:45:18,475 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-03-01 15:45:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:18,475 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-03-01 15:45:18,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-03-01 15:45:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:18,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:18,554 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:18,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:18,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:18,768 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1124442827, now seen corresponding path program 12 times [2022-03-01 15:45:18,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:18,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646780944] [2022-03-01 15:45:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:19,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:19,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646780944] [2022-03-01 15:45:19,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646780944] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:19,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635382966] [2022-03-01 15:45:19,302 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:45:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:19,316 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:19,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-01 15:45:19,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:45:19,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:19,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 15:45:19,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:20,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:20,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:45:20,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:45:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:45:20,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:20,402 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1556) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1556 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1556) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-01 15:45:20,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1556) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1556 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1556) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:45:20,417 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:20,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:45:20,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:45:20,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:45:20,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:20,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:45:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:20,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635382966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:20,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:20,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 42 [2022-03-01 15:45:20,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414530053] [2022-03-01 15:45:20,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:20,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-01 15:45:20,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-01 15:45:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1416, Unknown=2, NotChecked=154, Total=1722 [2022-03-01 15:45:20,837 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:22,769 INFO L93 Difference]: Finished difference Result 58699 states and 247716 transitions. [2022-03-01 15:45:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 15:45:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:22,997 INFO L225 Difference]: With dead ends: 58699 [2022-03-01 15:45:22,997 INFO L226 Difference]: Without dead ends: 55378 [2022-03-01 15:45:22,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 312 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=531, Invalid=3257, Unknown=2, NotChecked=242, Total=4032 [2022-03-01 15:45:22,998 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 915 mSDsluCounter, 5665 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 5285 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:22,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 5285 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1970 Invalid, 0 Unknown, 454 Unchecked, 0.7s Time] [2022-03-01 15:45:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55378 states. [2022-03-01 15:45:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55378 to 34177. [2022-03-01 15:45:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34177 states, 34176 states have (on average 4.134802200374532) internal successors, (141311), 34176 states have internal predecessors, (141311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34177 states to 34177 states and 141311 transitions. [2022-03-01 15:45:24,359 INFO L78 Accepts]: Start accepts. Automaton has 34177 states and 141311 transitions. Word has length 170 [2022-03-01 15:45:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:24,359 INFO L470 AbstractCegarLoop]: Abstraction has 34177 states and 141311 transitions. [2022-03-01 15:45:24,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34177 states and 141311 transitions. [2022-03-01 15:45:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:24,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:24,444 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:24,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:24,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-01 15:45:24,663 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 129350175, now seen corresponding path program 13 times [2022-03-01 15:45:24,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:24,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348471590] [2022-03-01 15:45:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:24,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:24,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348471590] [2022-03-01 15:45:24,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348471590] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:24,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759953796] [2022-03-01 15:45:24,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:45:24,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:24,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:24,936 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-01 15:45:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:25,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-01 15:45:25,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:25,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:45:25,894 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:45:25,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:45:25,902 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:45:25,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:45:26,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:45:26,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:45:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:26,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:26,533 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1607 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1607) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1607 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1607) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:45:26,540 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1607 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1607) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1607 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1607) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:45:26,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:26,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:45:26,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:45:26,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:45:26,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:26,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:45:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:27,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759953796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:27,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:27,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24, 21] total 49 [2022-03-01 15:45:27,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579475703] [2022-03-01 15:45:27,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:27,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-01 15:45:27,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:27,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-01 15:45:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1984, Unknown=2, NotChecked=182, Total=2352 [2022-03-01 15:45:27,032 INFO L87 Difference]: Start difference. First operand 34177 states and 141311 transitions. Second operand has 49 states, 49 states have (on average 5.816326530612245) internal successors, (285), 49 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:28,887 INFO L93 Difference]: Finished difference Result 56572 states and 237404 transitions. [2022-03-01 15:45:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-01 15:45:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.816326530612245) internal successors, (285), 49 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:29,099 INFO L225 Difference]: With dead ends: 56572 [2022-03-01 15:45:29,100 INFO L226 Difference]: Without dead ends: 55291 [2022-03-01 15:45:29,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 309 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5241, Unknown=4, NotChecked=306, Total=6320 [2022-03-01 15:45:29,100 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1647 mSDsluCounter, 6614 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 6141 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 985 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:29,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1647 Valid, 6141 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2065 Invalid, 0 Unknown, 985 Unchecked, 0.6s Time] [2022-03-01 15:45:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55291 states. [2022-03-01 15:45:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55291 to 34741. [2022-03-01 15:45:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34741 states, 34740 states have (on average 4.149194012665515) internal successors, (144143), 34740 states have internal predecessors, (144143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34741 states to 34741 states and 144143 transitions. [2022-03-01 15:45:30,769 INFO L78 Accepts]: Start accepts. Automaton has 34741 states and 144143 transitions. Word has length 170 [2022-03-01 15:45:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:30,769 INFO L470 AbstractCegarLoop]: Abstraction has 34741 states and 144143 transitions. [2022-03-01 15:45:30,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.816326530612245) internal successors, (285), 49 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34741 states and 144143 transitions. [2022-03-01 15:45:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:30,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:30,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:30,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:31,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-01 15:45:31,075 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash 59492663, now seen corresponding path program 14 times [2022-03-01 15:45:31,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:31,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478183682] [2022-03-01 15:45:31,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:31,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:31,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:31,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478183682] [2022-03-01 15:45:31,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478183682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:31,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111712756] [2022-03-01 15:45:31,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:45:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:31,535 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:31,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-01 15:45:31,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:45:31,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:31,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 15:45:31,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:32,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:32,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:45:32,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-01 15:45:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:32,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:32,962 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1656 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1656) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1656) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:45:32,969 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:32,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:45:32,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:45:32,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:45:32,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:32,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:45:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:33,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111712756] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:33,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:33,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 48 [2022-03-01 15:45:33,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960726705] [2022-03-01 15:45:33,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:33,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-01 15:45:33,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-01 15:45:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1940, Unknown=1, NotChecked=90, Total=2256 [2022-03-01 15:45:33,571 INFO L87 Difference]: Start difference. First operand 34741 states and 144143 transitions. Second operand has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:36,369 INFO L93 Difference]: Finished difference Result 117221 states and 495285 transitions. [2022-03-01 15:45:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 15:45:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:37,392 INFO L225 Difference]: With dead ends: 117221 [2022-03-01 15:45:37,392 INFO L226 Difference]: Without dead ends: 110579 [2022-03-01 15:45:37,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 305 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1170, Invalid=6143, Unknown=1, NotChecked=168, Total=7482 [2022-03-01 15:45:37,393 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 1828 mSDsluCounter, 6626 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 6071 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:37,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1828 Valid, 6071 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2648 Invalid, 0 Unknown, 417 Unchecked, 0.8s Time] [2022-03-01 15:45:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110579 states. [2022-03-01 15:45:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110579 to 33289. [2022-03-01 15:45:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33289 states, 33288 states have (on average 4.126502042778179) internal successors, (137363), 33288 states have internal predecessors, (137363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 137363 transitions. [2022-03-01 15:45:39,194 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 137363 transitions. Word has length 170 [2022-03-01 15:45:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:39,194 INFO L470 AbstractCegarLoop]: Abstraction has 33289 states and 137363 transitions. [2022-03-01 15:45:39,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 137363 transitions. [2022-03-01 15:45:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:39,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:39,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:39,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-01 15:45:39,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:39,480 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:39,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 49466847, now seen corresponding path program 15 times [2022-03-01 15:45:39,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:39,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800542312] [2022-03-01 15:45:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:39,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:39,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800542312] [2022-03-01 15:45:39,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800542312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:39,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521891067] [2022-03-01 15:45:39,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:45:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:39,729 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:39,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-01 15:45:40,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-01 15:45:40,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:40,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-01 15:45:40,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:40,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:45:40,533 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 15:45:40,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-01 15:45:40,562 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:45:40,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:45:40,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-01 15:45:40,926 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:40,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-01 15:45:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:41,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:41,830 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:41,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 81 [2022-03-01 15:45:41,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-03-01 15:45:41,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-03-01 15:45:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:45:42,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521891067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:42,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:42,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 24] total 57 [2022-03-01 15:45:42,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436066518] [2022-03-01 15:45:42,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:42,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-01 15:45:42,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-01 15:45:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2930, Unknown=7, NotChecked=0, Total=3192 [2022-03-01 15:45:42,975 INFO L87 Difference]: Start difference. First operand 33289 states and 137363 transitions. Second operand has 57 states, 57 states have (on average 5.491228070175438) internal successors, (313), 57 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:50,286 INFO L93 Difference]: Finished difference Result 144710 states and 603714 transitions. [2022-03-01 15:45:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-01 15:45:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.491228070175438) internal successors, (313), 57 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:51,638 INFO L225 Difference]: With dead ends: 144710 [2022-03-01 15:45:51,638 INFO L226 Difference]: Without dead ends: 142811 [2022-03-01 15:45:51,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 297 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4740 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2564, Invalid=16061, Unknown=7, NotChecked=0, Total=18632 [2022-03-01 15:45:51,640 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 3638 mSDsluCounter, 10452 mSDsCounter, 0 mSdLazyCounter, 4129 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3638 SdHoareTripleChecker+Valid, 9573 SdHoareTripleChecker+Invalid, 4945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 4129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 651 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:51,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3638 Valid, 9573 Invalid, 4945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 4129 Invalid, 0 Unknown, 651 Unchecked, 1.6s Time] [2022-03-01 15:45:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142811 states. [2022-03-01 15:45:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142811 to 34063. [2022-03-01 15:45:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34063 states, 34062 states have (on average 4.135106570371676) internal successors, (140850), 34062 states have internal predecessors, (140850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34063 states to 34063 states and 140850 transitions. [2022-03-01 15:45:53,983 INFO L78 Accepts]: Start accepts. Automaton has 34063 states and 140850 transitions. Word has length 170 [2022-03-01 15:45:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:45:53,983 INFO L470 AbstractCegarLoop]: Abstraction has 34063 states and 140850 transitions. [2022-03-01 15:45:53,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.491228070175438) internal successors, (313), 57 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34063 states and 140850 transitions. [2022-03-01 15:45:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:45:54,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:45:54,059 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:45:54,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-01 15:45:54,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-01 15:45:54,279 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:45:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:45:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash 998566901, now seen corresponding path program 16 times [2022-03-01 15:45:54,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:45:54,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009281693] [2022-03-01 15:45:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:45:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:45:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:45:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:54,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:45:54,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009281693] [2022-03-01 15:45:54,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009281693] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:45:54,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152548494] [2022-03-01 15:45:54,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:45:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:45:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:45:54,613 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:45:54,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-01 15:45:55,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:45:55,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:45:55,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-01 15:45:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:45:55,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:45:55,366 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:45:55,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:45:55,373 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:45:55,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:45:55,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:45:55,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:45:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:45:55,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:45:55,982 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1758) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0))) (forall ((v_ArrVal_1758 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1758) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0)))) is different from false [2022-03-01 15:45:55,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:45:55,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:45:55,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:45:56,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:45:56,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:45:56,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:45:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:45:56,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152548494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:45:56,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:45:56,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 39 [2022-03-01 15:45:56,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530947399] [2022-03-01 15:45:56,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:45:56,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 15:45:56,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:45:56,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 15:45:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1285, Unknown=1, NotChecked=72, Total=1482 [2022-03-01 15:45:56,296 INFO L87 Difference]: Start difference. First operand 34063 states and 140850 transitions. Second operand has 39 states, 39 states have (on average 6.769230769230769) internal successors, (264), 39 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:45:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:45:58,321 INFO L93 Difference]: Finished difference Result 55976 states and 235455 transitions. [2022-03-01 15:45:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 15:45:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.769230769230769) internal successors, (264), 39 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:45:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:45:58,551 INFO L225 Difference]: With dead ends: 55976 [2022-03-01 15:45:58,551 INFO L226 Difference]: Without dead ends: 52955 [2022-03-01 15:45:58,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=576, Invalid=3847, Unknown=3, NotChecked=130, Total=4556 [2022-03-01 15:45:58,552 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1314 mSDsluCounter, 5286 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 4884 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:45:58,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1314 Valid, 4884 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1932 Invalid, 0 Unknown, 559 Unchecked, 0.7s Time] [2022-03-01 15:45:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52955 states. [2022-03-01 15:45:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52955 to 34144. [2022-03-01 15:45:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34144 states, 34143 states have (on average 4.1364554960021085) internal successors, (141231), 34143 states have internal predecessors, (141231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34144 states to 34144 states and 141231 transitions. [2022-03-01 15:46:00,030 INFO L78 Accepts]: Start accepts. Automaton has 34144 states and 141231 transitions. Word has length 170 [2022-03-01 15:46:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:00,030 INFO L470 AbstractCegarLoop]: Abstraction has 34144 states and 141231 transitions. [2022-03-01 15:46:00,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.769230769230769) internal successors, (264), 39 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34144 states and 141231 transitions. [2022-03-01 15:46:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:00,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:00,114 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:00,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:00,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-01 15:46:00,332 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1481333173, now seen corresponding path program 17 times [2022-03-01 15:46:00,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:00,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655932140] [2022-03-01 15:46:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:00,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:00,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655932140] [2022-03-01 15:46:00,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655932140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:00,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964502035] [2022-03-01 15:46:00,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:46:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:00,593 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:00,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-01 15:46:00,772 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:46:00,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:00,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-01 15:46:00,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:01,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:01,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-01 15:46:01,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:01,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-01 15:46:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:46:01,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:02,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:02,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:46:02,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:46:02,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:02,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:02,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:46:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:02,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964502035] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:02,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:02,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 45 [2022-03-01 15:46:02,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886294423] [2022-03-01 15:46:02,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:02,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-01 15:46:02,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-01 15:46:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1807, Unknown=4, NotChecked=0, Total=1980 [2022-03-01 15:46:02,616 INFO L87 Difference]: Start difference. First operand 34144 states and 141231 transitions. Second operand has 45 states, 45 states have (on average 6.466666666666667) internal successors, (291), 45 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:04,539 INFO L93 Difference]: Finished difference Result 80426 states and 338786 transitions. [2022-03-01 15:46:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 15:46:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.466666666666667) internal successors, (291), 45 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:05,090 INFO L225 Difference]: With dead ends: 80426 [2022-03-01 15:46:05,090 INFO L226 Difference]: Without dead ends: 75239 [2022-03-01 15:46:05,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=573, Invalid=3979, Unknown=4, NotChecked=0, Total=4556 [2022-03-01 15:46:05,091 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 1545 mSDsluCounter, 6020 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 5644 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:05,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 5644 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1912 Invalid, 0 Unknown, 341 Unchecked, 0.6s Time] [2022-03-01 15:46:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75239 states. [2022-03-01 15:46:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75239 to 33477. [2022-03-01 15:46:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33477 states, 33476 states have (on average 4.128091767236229) internal successors, (138192), 33476 states have internal predecessors, (138192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 138192 transitions. [2022-03-01 15:46:06,642 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 138192 transitions. Word has length 170 [2022-03-01 15:46:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:06,642 INFO L470 AbstractCegarLoop]: Abstraction has 33477 states and 138192 transitions. [2022-03-01 15:46:06,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.466666666666667) internal successors, (291), 45 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 138192 transitions. [2022-03-01 15:46:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:06,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:06,712 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:06,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:06,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-01 15:46:06,928 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 424458461, now seen corresponding path program 13 times [2022-03-01 15:46:06,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:06,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517478499] [2022-03-01 15:46:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:07,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:07,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517478499] [2022-03-01 15:46:07,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517478499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:07,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777202080] [2022-03-01 15:46:07,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:46:07,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:07,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:07,185 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:07,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-01 15:46:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:07,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-01 15:46:07,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:07,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:46:07,419 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:46:07,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:46:07,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:07,666 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:46:07,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-03-01 15:46:07,694 INFO L353 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-03-01 15:46:07,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 28 [2022-03-01 15:46:07,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:46:07,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:46:07,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:46:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:46:08,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:08,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1860 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1860) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-01 15:46:08,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1859 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1859) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1860) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-01 15:46:08,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1859 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1859) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1860) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-03-01 15:46:08,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:08,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 89 [2022-03-01 15:46:08,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-03-01 15:46:08,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-03-01 15:46:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-01 15:46:10,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777202080] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:10,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:10,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 20] total 49 [2022-03-01 15:46:10,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026950506] [2022-03-01 15:46:10,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:10,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-01 15:46:10,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-01 15:46:10,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1919, Unknown=3, NotChecked=270, Total=2352 [2022-03-01 15:46:10,851 INFO L87 Difference]: Start difference. First operand 33477 states and 138192 transitions. Second operand has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:15,676 INFO L93 Difference]: Finished difference Result 86258 states and 360955 transitions. [2022-03-01 15:46:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-01 15:46:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:16,273 INFO L225 Difference]: With dead ends: 86258 [2022-03-01 15:46:16,273 INFO L226 Difference]: Without dead ends: 83177 [2022-03-01 15:46:16,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 312 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1019, Invalid=6130, Unknown=3, NotChecked=504, Total=7656 [2022-03-01 15:46:16,274 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 2846 mSDsluCounter, 7124 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2846 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 6071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2871 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:16,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2846 Valid, 6316 Invalid, 6071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2983 Invalid, 0 Unknown, 2871 Unchecked, 1.7s Time] [2022-03-01 15:46:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83177 states. [2022-03-01 15:46:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83177 to 34087. [2022-03-01 15:46:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34087 states, 34086 states have (on average 4.123305756028868) internal successors, (140547), 34086 states have internal predecessors, (140547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 140547 transitions. [2022-03-01 15:46:18,130 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 140547 transitions. Word has length 170 [2022-03-01 15:46:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:18,131 INFO L470 AbstractCegarLoop]: Abstraction has 34087 states and 140547 transitions. [2022-03-01 15:46:18,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 140547 transitions. [2022-03-01 15:46:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:18,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:18,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:18,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:18,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:18,438 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash -110917851, now seen corresponding path program 14 times [2022-03-01 15:46:18,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:18,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730195881] [2022-03-01 15:46:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:18,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:18,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730195881] [2022-03-01 15:46:18,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730195881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:18,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013740212] [2022-03-01 15:46:18,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:46:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:18,836 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:18,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-01 15:46:19,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:46:19,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:19,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 15:46:19,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:19,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:46:19,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:19,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-03-01 15:46:19,642 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:46:19,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:46:19,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:19,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:19,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:19,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:46:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:46:20,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:20,369 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1912 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1912) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1912 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1912) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-03-01 15:46:20,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1911) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1912) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1911) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1912) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-01 15:46:20,424 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:20,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 81 [2022-03-01 15:46:20,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-03-01 15:46:20,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-03-01 15:46:20,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:20,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:20,474 INFO L353 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-03-01 15:46:20,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2022-03-01 15:46:24,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-03-01 15:46:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:24,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013740212] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:24,210 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:24,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 48 [2022-03-01 15:46:24,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632305359] [2022-03-01 15:46:24,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:24,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-01 15:46:24,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-01 15:46:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1917, Unknown=3, NotChecked=178, Total=2256 [2022-03-01 15:46:24,212 INFO L87 Difference]: Start difference. First operand 34087 states and 140547 transitions. Second operand has 48 states, 48 states have (on average 7.0) internal successors, (336), 48 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:27,525 INFO L93 Difference]: Finished difference Result 64563 states and 270773 transitions. [2022-03-01 15:46:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 15:46:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 7.0) internal successors, (336), 48 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:27,958 INFO L225 Difference]: With dead ends: 64563 [2022-03-01 15:46:27,958 INFO L226 Difference]: Without dead ends: 61482 [2022-03-01 15:46:27,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 307 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=762, Invalid=5563, Unknown=3, NotChecked=314, Total=6642 [2022-03-01 15:46:27,959 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1888 mSDsluCounter, 7733 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 6878 SdHoareTripleChecker+Invalid, 4767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1746 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:27,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1888 Valid, 6878 Invalid, 4767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2923 Invalid, 0 Unknown, 1746 Unchecked, 1.2s Time] [2022-03-01 15:46:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61482 states. [2022-03-01 15:46:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61482 to 34447. [2022-03-01 15:46:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34447 states, 34446 states have (on average 4.1256749695175055) internal successors, (142113), 34446 states have internal predecessors, (142113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34447 states to 34447 states and 142113 transitions. [2022-03-01 15:46:29,187 INFO L78 Accepts]: Start accepts. Automaton has 34447 states and 142113 transitions. Word has length 170 [2022-03-01 15:46:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:29,188 INFO L470 AbstractCegarLoop]: Abstraction has 34447 states and 142113 transitions. [2022-03-01 15:46:29,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.0) internal successors, (336), 48 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34447 states and 142113 transitions. [2022-03-01 15:46:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:29,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:29,273 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:29,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:29,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:29,491 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1913599967, now seen corresponding path program 15 times [2022-03-01 15:46:29,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:29,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587560368] [2022-03-01 15:46:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:30,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:30,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587560368] [2022-03-01 15:46:30,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587560368] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:30,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840277010] [2022-03-01 15:46:30,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:46:30,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:30,083 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-01 15:46:30,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:46:30,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:30,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-01 15:46:30,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:30,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:46:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:30,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-03-01 15:46:30,653 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:46:30,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:46:30,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:30,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:30,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:46:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:31,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:31,275 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1964 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1964 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-01 15:46:31,342 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-03-01 15:46:31,352 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:31,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 157 [2022-03-01 15:46:31,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-03-01 15:46:31,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-03-01 15:46:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:31,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:31,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-03-01 15:46:33,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-03-01 15:46:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:33,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840277010] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:33,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:33,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 45 [2022-03-01 15:46:33,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294866523] [2022-03-01 15:46:33,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:33,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-01 15:46:33,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-01 15:46:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1667, Unknown=2, NotChecked=166, Total=1980 [2022-03-01 15:46:33,294 INFO L87 Difference]: Start difference. First operand 34447 states and 142113 transitions. Second operand has 45 states, 45 states have (on average 7.311111111111111) internal successors, (329), 45 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:35,745 INFO L93 Difference]: Finished difference Result 58393 states and 244727 transitions. [2022-03-01 15:46:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 15:46:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.311111111111111) internal successors, (329), 45 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:35,970 INFO L225 Difference]: With dead ends: 58393 [2022-03-01 15:46:35,970 INFO L226 Difference]: Without dead ends: 55312 [2022-03-01 15:46:35,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 311 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=741, Invalid=4095, Unknown=2, NotChecked=274, Total=5112 [2022-03-01 15:46:35,971 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 1828 mSDsluCounter, 6138 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 5614 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1068 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:35,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1828 Valid, 5614 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1990 Invalid, 0 Unknown, 1068 Unchecked, 0.7s Time] [2022-03-01 15:46:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55312 states. [2022-03-01 15:46:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55312 to 34547. [2022-03-01 15:46:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 34546 states have (on average 4.126671684131304) internal successors, (142560), 34546 states have internal predecessors, (142560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 142560 transitions. [2022-03-01 15:46:37,302 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 142560 transitions. Word has length 170 [2022-03-01 15:46:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:37,302 INFO L470 AbstractCegarLoop]: Abstraction has 34547 states and 142560 transitions. [2022-03-01 15:46:37,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.311111111111111) internal successors, (329), 45 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 142560 transitions. [2022-03-01 15:46:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:37,386 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:37,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:37,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:37,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-01 15:46:37,594 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -98734997, now seen corresponding path program 16 times [2022-03-01 15:46:37,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:37,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058371156] [2022-03-01 15:46:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:38,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:38,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058371156] [2022-03-01 15:46:38,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058371156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:38,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165045866] [2022-03-01 15:46:38,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:46:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:38,041 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:38,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-01 15:46:38,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:46:38,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:38,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-01 15:46:38,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:38,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:38,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:38,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:38,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:46:39,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:46:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:46:39,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:39,464 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2014 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2014) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_2014 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2014) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0)))) is different from false [2022-03-01 15:46:39,516 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2014) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1))) (forall ((v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2014) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0)))) is different from false [2022-03-01 15:46:39,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:39,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 165 [2022-03-01 15:46:39,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2022-03-01 15:46:39,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2022-03-01 15:46:39,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:39,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:39,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:39,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-03-01 15:46:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:40,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165045866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:40,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:40,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 46 [2022-03-01 15:46:40,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261584700] [2022-03-01 15:46:40,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:40,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-01 15:46:40,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:40,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-01 15:46:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1747, Unknown=2, NotChecked=170, Total=2070 [2022-03-01 15:46:40,081 INFO L87 Difference]: Start difference. First operand 34547 states and 142560 transitions. Second operand has 46 states, 46 states have (on average 8.326086956521738) internal successors, (383), 46 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:42,708 INFO L93 Difference]: Finished difference Result 58119 states and 243894 transitions. [2022-03-01 15:46:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 15:46:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 8.326086956521738) internal successors, (383), 46 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:43,071 INFO L225 Difference]: With dead ends: 58119 [2022-03-01 15:46:43,071 INFO L226 Difference]: Without dead ends: 54798 [2022-03-01 15:46:43,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 310 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=855, Invalid=4701, Unknown=2, NotChecked=294, Total=5852 [2022-03-01 15:46:43,072 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 2119 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 720 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:43,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2119 Valid, 5083 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2241 Invalid, 0 Unknown, 720 Unchecked, 0.8s Time] [2022-03-01 15:46:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54798 states. [2022-03-01 15:46:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54798 to 33897. [2022-03-01 15:46:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33897 states, 33896 states have (on average 4.123406891668633) internal successors, (139767), 33896 states have internal predecessors, (139767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33897 states to 33897 states and 139767 transitions. [2022-03-01 15:46:44,274 INFO L78 Accepts]: Start accepts. Automaton has 33897 states and 139767 transitions. Word has length 170 [2022-03-01 15:46:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:44,274 INFO L470 AbstractCegarLoop]: Abstraction has 33897 states and 139767 transitions. [2022-03-01 15:46:44,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 8.326086956521738) internal successors, (383), 46 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33897 states and 139767 transitions. [2022-03-01 15:46:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:44,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:44,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:44,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:44,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-01 15:46:44,551 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash 561630503, now seen corresponding path program 17 times [2022-03-01 15:46:44,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:44,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416964202] [2022-03-01 15:46:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:45,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:45,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416964202] [2022-03-01 15:46:45,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416964202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:45,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879244501] [2022-03-01 15:46:45,162 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:46:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:45,176 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:45,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-01 15:46:45,376 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:46:45,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:45,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-01 15:46:45,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:46:45,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:46:45,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:46:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:45,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:46,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2063 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2063) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_2063 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2063) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-01 15:46:46,198 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2063 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2063) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2063 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2063) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-01 15:46:46,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:46,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:46:46,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:46:46,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:46,233 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:46:46,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:46:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:46,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879244501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:46,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:46,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-03-01 15:46:46,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066947735] [2022-03-01 15:46:46,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:46,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:46:46,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:46:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1140, Unknown=2, NotChecked=138, Total=1406 [2022-03-01 15:46:46,572 INFO L87 Difference]: Start difference. First operand 33897 states and 139767 transitions. Second operand has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:48,404 INFO L93 Difference]: Finished difference Result 58954 states and 247963 transitions. [2022-03-01 15:46:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 15:46:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:48,659 INFO L225 Difference]: With dead ends: 58954 [2022-03-01 15:46:48,659 INFO L226 Difference]: Without dead ends: 57153 [2022-03-01 15:46:48,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=487, Invalid=2711, Unknown=2, NotChecked=222, Total=3422 [2022-03-01 15:46:48,660 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1103 mSDsluCounter, 4216 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:48,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1103 Valid, 4034 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1371 Invalid, 0 Unknown, 731 Unchecked, 0.5s Time] [2022-03-01 15:46:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57153 states. [2022-03-01 15:46:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57153 to 35055. [2022-03-01 15:46:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35055 states, 35054 states have (on average 4.138586181320249) internal successors, (145074), 35054 states have internal predecessors, (145074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35055 states to 35055 states and 145074 transitions. [2022-03-01 15:46:50,129 INFO L78 Accepts]: Start accepts. Automaton has 35055 states and 145074 transitions. Word has length 170 [2022-03-01 15:46:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:46:50,130 INFO L470 AbstractCegarLoop]: Abstraction has 35055 states and 145074 transitions. [2022-03-01 15:46:50,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 35055 states and 145074 transitions. [2022-03-01 15:46:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:46:50,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:46:50,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:46:50,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-01 15:46:50,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-01 15:46:50,436 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:46:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:46:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1855561563, now seen corresponding path program 18 times [2022-03-01 15:46:50,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:46:50,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869773230] [2022-03-01 15:46:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:46:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:46:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:46:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:46:50,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:46:50,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869773230] [2022-03-01 15:46:50,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869773230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:46:50,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126995201] [2022-03-01 15:46:50,786 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:46:50,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:46:50,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:46:50,796 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:46:50,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-01 15:46:51,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:46:51,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:46:51,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-01 15:46:51,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:46:51,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:46:51,715 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:46:51,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:46:51,730 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:46:51,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:46:51,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:46:52,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-01 15:46:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:46:52,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:46:52,364 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2114 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2114) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))))) (forall ((v_ArrVal_2114 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2114) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0)))) is different from false [2022-03-01 15:46:52,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2114 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2114) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2114 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2114) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-01 15:46:52,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:46:52,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:46:52,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:46:52,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:46:52,415 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:46:52,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-03-01 15:46:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:46:53,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126995201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:46:53,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:46:53,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 48 [2022-03-01 15:46:53,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171970005] [2022-03-01 15:46:53,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:46:53,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-01 15:46:53,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:46:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-01 15:46:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1884, Unknown=2, NotChecked=178, Total=2256 [2022-03-01 15:46:53,005 INFO L87 Difference]: Start difference. First operand 35055 states and 145074 transitions. Second operand has 48 states, 48 states have (on average 5.5) internal successors, (264), 48 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:46:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:46:56,921 INFO L93 Difference]: Finished difference Result 126752 states and 535122 transitions. [2022-03-01 15:46:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-01 15:46:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.5) internal successors, (264), 48 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:46:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:46:58,124 INFO L225 Difference]: With dead ends: 126752 [2022-03-01 15:46:58,124 INFO L226 Difference]: Without dead ends: 120711 [2022-03-01 15:46:58,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1417, Invalid=8084, Unknown=13, NotChecked=386, Total=9900 [2022-03-01 15:46:58,125 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 2764 mSDsluCounter, 6982 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 6371 SdHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1185 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:46:58,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2764 Valid, 6371 Invalid, 4029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2693 Invalid, 0 Unknown, 1185 Unchecked, 1.1s Time] [2022-03-01 15:46:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120711 states. [2022-03-01 15:47:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120711 to 33837. [2022-03-01 15:47:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33837 states, 33836 states have (on average 4.130452772195295) internal successors, (139758), 33836 states have internal predecessors, (139758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33837 states to 33837 states and 139758 transitions. [2022-03-01 15:47:00,507 INFO L78 Accepts]: Start accepts. Automaton has 33837 states and 139758 transitions. Word has length 170 [2022-03-01 15:47:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:00,507 INFO L470 AbstractCegarLoop]: Abstraction has 33837 states and 139758 transitions. [2022-03-01 15:47:00,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.5) internal successors, (264), 48 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33837 states and 139758 transitions. [2022-03-01 15:47:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:00,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:00,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:00,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:00,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-01 15:47:00,809 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1684417633, now seen corresponding path program 19 times [2022-03-01 15:47:00,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:00,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228706347] [2022-03-01 15:47:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:01,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:01,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228706347] [2022-03-01 15:47:01,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228706347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:01,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391141447] [2022-03-01 15:47:01,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:47:01,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:01,516 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:01,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-01 15:47:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:01,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 15:47:01,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:02,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:02,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:02,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:47:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:47:02,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:02,582 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2163 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2163) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2163 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2163) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-01 15:47:02,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:02,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:47:02,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:47:02,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:02,621 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:47:02,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:47:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:03,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391141447] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:03,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:03,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 41 [2022-03-01 15:47:03,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710713663] [2022-03-01 15:47:03,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:03,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 15:47:03,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 15:47:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1423, Unknown=1, NotChecked=76, Total=1640 [2022-03-01 15:47:03,008 INFO L87 Difference]: Start difference. First operand 33837 states and 139758 transitions. Second operand has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:04,946 INFO L93 Difference]: Finished difference Result 55973 states and 234432 transitions. [2022-03-01 15:47:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 15:47:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:05,169 INFO L225 Difference]: With dead ends: 55973 [2022-03-01 15:47:05,169 INFO L226 Difference]: Without dead ends: 52892 [2022-03-01 15:47:05,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 315 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=3378, Unknown=1, NotChecked=122, Total=4032 [2022-03-01 15:47:05,170 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1083 mSDsluCounter, 4859 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:05,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 4553 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1653 Invalid, 0 Unknown, 305 Unchecked, 0.6s Time] [2022-03-01 15:47:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52892 states. [2022-03-01 15:47:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52892 to 33937. [2022-03-01 15:47:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33937 states, 33936 states have (on average 4.131453323903819) internal successors, (140205), 33936 states have internal predecessors, (140205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33937 states to 33937 states and 140205 transitions. [2022-03-01 15:47:06,572 INFO L78 Accepts]: Start accepts. Automaton has 33937 states and 140205 transitions. Word has length 170 [2022-03-01 15:47:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:06,572 INFO L470 AbstractCegarLoop]: Abstraction has 33937 states and 140205 transitions. [2022-03-01 15:47:06,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 33937 states and 140205 transitions. [2022-03-01 15:47:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:06,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:06,652 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:06,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:06,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:06,863 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2145151155, now seen corresponding path program 20 times [2022-03-01 15:47:06,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:06,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561602290] [2022-03-01 15:47:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:07,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:07,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561602290] [2022-03-01 15:47:07,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561602290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:07,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645852665] [2022-03-01 15:47:07,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:47:07,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:07,125 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:07,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-01 15:47:07,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:47:07,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:07,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-01 15:47:07,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:07,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:07,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-01 15:47:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:08,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:08,278 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2212 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2212) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 1))) (forall ((v_ArrVal_2212 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2212) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 c_~s_2~0)))) is different from false [2022-03-01 15:47:08,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:08,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:47:08,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:47:08,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:08,310 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:47:08,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:47:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:08,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645852665] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:08,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:08,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-01 15:47:08,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625193275] [2022-03-01 15:47:08,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:08,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-01 15:47:08,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-01 15:47:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=940, Unknown=1, NotChecked=62, Total=1122 [2022-03-01 15:47:08,654 INFO L87 Difference]: Start difference. First operand 33937 states and 140205 transitions. Second operand has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:10,134 INFO L93 Difference]: Finished difference Result 55499 states and 232717 transitions. [2022-03-01 15:47:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 15:47:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:10,349 INFO L225 Difference]: With dead ends: 55499 [2022-03-01 15:47:10,350 INFO L226 Difference]: Without dead ends: 52178 [2022-03-01 15:47:10,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 322 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=2079, Unknown=1, NotChecked=96, Total=2550 [2022-03-01 15:47:10,350 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 847 mSDsluCounter, 4531 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:10,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 4295 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1317 Invalid, 0 Unknown, 383 Unchecked, 0.5s Time] [2022-03-01 15:47:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52178 states. [2022-03-01 15:47:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52178 to 33477. [2022-03-01 15:47:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33477 states, 33476 states have (on average 4.128091767236229) internal successors, (138192), 33476 states have internal predecessors, (138192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 138192 transitions. [2022-03-01 15:47:11,737 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 138192 transitions. Word has length 170 [2022-03-01 15:47:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:11,737 INFO L470 AbstractCegarLoop]: Abstraction has 33477 states and 138192 transitions. [2022-03-01 15:47:11,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 138192 transitions. [2022-03-01 15:47:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:11,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:11,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:11,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:12,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-01 15:47:12,060 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1481868481, now seen corresponding path program 21 times [2022-03-01 15:47:12,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:12,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001319805] [2022-03-01 15:47:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:12,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:12,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001319805] [2022-03-01 15:47:12,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001319805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:12,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034110093] [2022-03-01 15:47:12,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:47:12,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:12,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:12,309 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:12,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-01 15:47:12,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:47:12,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:12,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-01 15:47:12,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:12,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:12,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:47:12,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:47:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:13,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:13,283 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2261 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2261) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2261 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2261) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-01 15:47:13,291 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2261 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2261) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2261 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2261) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:13,299 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:13,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:47:13,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:47:13,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:13,328 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:13,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:47:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:13,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034110093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:13,723 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:13,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-03-01 15:47:13,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136029048] [2022-03-01 15:47:13,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:13,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:47:13,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:13,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:47:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1133, Unknown=2, NotChecked=138, Total=1406 [2022-03-01 15:47:13,724 INFO L87 Difference]: Start difference. First operand 33477 states and 138192 transitions. Second operand has 38 states, 38 states have (on average 6.921052631578948) internal successors, (263), 38 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:15,268 INFO L93 Difference]: Finished difference Result 54701 states and 228857 transitions. [2022-03-01 15:47:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 15:47:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.921052631578948) internal successors, (263), 38 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:15,645 INFO L225 Difference]: With dead ends: 54701 [2022-03-01 15:47:15,645 INFO L226 Difference]: Without dead ends: 54520 [2022-03-01 15:47:15,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=414, Invalid=2244, Unknown=2, NotChecked=202, Total=2862 [2022-03-01 15:47:15,646 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 915 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:15,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 4158 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1338 Invalid, 0 Unknown, 768 Unchecked, 0.7s Time] [2022-03-01 15:47:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54520 states. [2022-03-01 15:47:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54520 to 39061. [2022-03-01 15:47:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39061 states, 39060 states have (on average 4.153609831029186) internal successors, (162240), 39060 states have internal predecessors, (162240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39061 states to 39061 states and 162240 transitions. [2022-03-01 15:47:16,821 INFO L78 Accepts]: Start accepts. Automaton has 39061 states and 162240 transitions. Word has length 170 [2022-03-01 15:47:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:16,821 INFO L470 AbstractCegarLoop]: Abstraction has 39061 states and 162240 transitions. [2022-03-01 15:47:16,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.921052631578948) internal successors, (263), 38 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39061 states and 162240 transitions. [2022-03-01 15:47:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:17,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:17,169 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:17,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-01 15:47:17,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-01 15:47:17,387 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1073044256, now seen corresponding path program 2 times [2022-03-01 15:47:17,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:17,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408463431] [2022-03-01 15:47:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:17,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:17,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408463431] [2022-03-01 15:47:17,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408463431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:17,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035100733] [2022-03-01 15:47:17,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:47:17,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:17,750 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:17,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-01 15:47:17,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:47:17,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:17,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 15:47:17,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:18,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:18,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:47:18,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-01 15:47:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:47:18,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:18,784 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2310 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2310) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2310 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2310) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-01 15:47:18,792 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2310 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2310) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2310 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2310) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:18,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:18,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:47:18,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:47:18,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:18,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:18,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:47:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:47:19,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035100733] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:19,451 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:19,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 24] total 47 [2022-03-01 15:47:19,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157686771] [2022-03-01 15:47:19,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:19,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-01 15:47:19,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-01 15:47:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1761, Unknown=2, NotChecked=174, Total=2162 [2022-03-01 15:47:19,453 INFO L87 Difference]: Start difference. First operand 39061 states and 162240 transitions. Second operand has 47 states, 47 states have (on average 5.574468085106383) internal successors, (262), 47 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:22,653 INFO L93 Difference]: Finished difference Result 125570 states and 528619 transitions. [2022-03-01 15:47:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 15:47:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.574468085106383) internal successors, (262), 47 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:23,240 INFO L225 Difference]: With dead ends: 125570 [2022-03-01 15:47:23,240 INFO L226 Difference]: Without dead ends: 118208 [2022-03-01 15:47:23,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 309 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1241, Invalid=6075, Unknown=2, NotChecked=338, Total=7656 [2022-03-01 15:47:23,241 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 2094 mSDsluCounter, 5723 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1056 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:23,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2094 Valid, 5324 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2093 Invalid, 0 Unknown, 1056 Unchecked, 0.7s Time] [2022-03-01 15:47:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118208 states. [2022-03-01 15:47:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118208 to 41401. [2022-03-01 15:47:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41401 states, 41400 states have (on average 4.157004830917875) internal successors, (172100), 41400 states have internal predecessors, (172100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41401 states to 41401 states and 172100 transitions. [2022-03-01 15:47:25,871 INFO L78 Accepts]: Start accepts. Automaton has 41401 states and 172100 transitions. Word has length 170 [2022-03-01 15:47:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:25,871 INFO L470 AbstractCegarLoop]: Abstraction has 41401 states and 172100 transitions. [2022-03-01 15:47:25,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.574468085106383) internal successors, (262), 47 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41401 states and 172100 transitions. [2022-03-01 15:47:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:26,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:26,010 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:26,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:26,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-01 15:47:26,228 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 666438812, now seen corresponding path program 3 times [2022-03-01 15:47:26,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:26,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20005260] [2022-03-01 15:47:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:26,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:26,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20005260] [2022-03-01 15:47:26,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20005260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:26,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155660183] [2022-03-01 15:47:26,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:47:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:26,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:26,581 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:26,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-01 15:47:26,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:47:26,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:26,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-01 15:47:26,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:27,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:27,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:47:27,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:47:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:27,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:27,551 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2359 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2359 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:27,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2359 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2359 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2359) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:47:27,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:27,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:47:27,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:47:27,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:27,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:27,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-01 15:47:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:28,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155660183] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:28,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:28,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-03-01 15:47:28,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983416021] [2022-03-01 15:47:28,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:28,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:47:28,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:47:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1133, Unknown=2, NotChecked=138, Total=1406 [2022-03-01 15:47:28,012 INFO L87 Difference]: Start difference. First operand 41401 states and 172100 transitions. Second operand has 38 states, 38 states have (on average 6.973684210526316) internal successors, (265), 38 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:29,652 INFO L93 Difference]: Finished difference Result 60217 states and 252167 transitions. [2022-03-01 15:47:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 15:47:29,652 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.973684210526316) internal successors, (265), 38 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:30,065 INFO L225 Difference]: With dead ends: 60217 [2022-03-01 15:47:30,066 INFO L226 Difference]: Without dead ends: 56536 [2022-03-01 15:47:30,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=440, Invalid=2322, Unknown=2, NotChecked=206, Total=2970 [2022-03-01 15:47:30,066 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 1279 mSDsluCounter, 3603 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:30,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1279 Valid, 3453 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1152 Invalid, 0 Unknown, 521 Unchecked, 0.5s Time] [2022-03-01 15:47:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56536 states. [2022-03-01 15:47:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56536 to 33493. [2022-03-01 15:47:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33493 states, 33492 states have (on average 4.121700704645885) internal successors, (138044), 33492 states have internal predecessors, (138044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33493 states to 33493 states and 138044 transitions. [2022-03-01 15:47:31,387 INFO L78 Accepts]: Start accepts. Automaton has 33493 states and 138044 transitions. Word has length 170 [2022-03-01 15:47:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:31,387 INFO L470 AbstractCegarLoop]: Abstraction has 33493 states and 138044 transitions. [2022-03-01 15:47:31,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.973684210526316) internal successors, (265), 38 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33493 states and 138044 transitions. [2022-03-01 15:47:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:31,464 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:31,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:31,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-01 15:47:31,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:31,681 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1088212455, now seen corresponding path program 22 times [2022-03-01 15:47:31,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:31,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841070422] [2022-03-01 15:47:31,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:47:32,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:32,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841070422] [2022-03-01 15:47:32,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841070422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:32,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724867373] [2022-03-01 15:47:32,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:47:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:32,474 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:32,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-01 15:47:32,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:47:32,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:32,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-01 15:47:32,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:33,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:33,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:33,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-01 15:47:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:47:33,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:33,632 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2408 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2408) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0))) (forall ((v_ArrVal_2408 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2408) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0)))) is different from false [2022-03-01 15:47:33,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:33,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:47:33,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:47:33,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:33,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:33,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:47:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:34,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724867373] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:34,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:34,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 17] total 50 [2022-03-01 15:47:34,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413456707] [2022-03-01 15:47:34,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:34,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-01 15:47:34,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-01 15:47:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2166, Unknown=1, NotChecked=94, Total=2450 [2022-03-01 15:47:34,029 INFO L87 Difference]: Start difference. First operand 33493 states and 138044 transitions. Second operand has 50 states, 50 states have (on average 6.58) internal successors, (329), 50 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:36,385 INFO L93 Difference]: Finished difference Result 56108 states and 234197 transitions. [2022-03-01 15:47:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-01 15:47:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.58) internal successors, (329), 50 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:36,614 INFO L225 Difference]: With dead ends: 56108 [2022-03-01 15:47:36,614 INFO L226 Difference]: Without dead ends: 52727 [2022-03-01 15:47:36,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 315 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=759, Invalid=5096, Unknown=1, NotChecked=150, Total=6006 [2022-03-01 15:47:36,615 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1643 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 4377 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:36,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 4377 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2276 Invalid, 0 Unknown, 339 Unchecked, 0.8s Time] [2022-03-01 15:47:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52727 states. [2022-03-01 15:47:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52727 to 33217. [2022-03-01 15:47:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33217 states, 33216 states have (on average 4.118768063583815) internal successors, (136809), 33216 states have internal predecessors, (136809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33217 states to 33217 states and 136809 transitions. [2022-03-01 15:47:37,760 INFO L78 Accepts]: Start accepts. Automaton has 33217 states and 136809 transitions. Word has length 170 [2022-03-01 15:47:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:37,760 INFO L470 AbstractCegarLoop]: Abstraction has 33217 states and 136809 transitions. [2022-03-01 15:47:37,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.58) internal successors, (329), 50 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33217 states and 136809 transitions. [2022-03-01 15:47:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:37,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:37,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:37,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-01 15:47:38,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:38,052 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -709000477, now seen corresponding path program 18 times [2022-03-01 15:47:38,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:38,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612152201] [2022-03-01 15:47:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:38,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:38,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612152201] [2022-03-01 15:47:38,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612152201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:38,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52331183] [2022-03-01 15:47:38,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:47:38,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:38,572 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:38,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-01 15:47:38,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:47:38,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 15:47:38,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:39,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:39,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:47:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:47:39,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:39,562 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2457 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2457) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2457 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2457) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:47:39,595 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:39,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:47:39,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:47:39,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:39,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:47:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:39,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52331183] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:39,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:39,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 41 [2022-03-01 15:47:39,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942398289] [2022-03-01 15:47:39,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:39,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 15:47:39,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 15:47:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1419, Unknown=1, NotChecked=76, Total=1640 [2022-03-01 15:47:39,971 INFO L87 Difference]: Start difference. First operand 33217 states and 136809 transitions. Second operand has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:41,728 INFO L93 Difference]: Finished difference Result 52821 states and 221891 transitions. [2022-03-01 15:47:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 15:47:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:41,928 INFO L225 Difference]: With dead ends: 52821 [2022-03-01 15:47:41,928 INFO L226 Difference]: Without dead ends: 49500 [2022-03-01 15:47:41,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 314 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=3168, Unknown=1, NotChecked=118, Total=3782 [2022-03-01 15:47:41,928 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 902 mSDsluCounter, 5398 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 5055 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:41,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 5055 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1957 Invalid, 0 Unknown, 315 Unchecked, 0.7s Time] [2022-03-01 15:47:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49500 states. [2022-03-01 15:47:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49500 to 32893. [2022-03-01 15:47:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32893 states, 32892 states have (on average 4.116320077830475) internal successors, (135394), 32892 states have internal predecessors, (135394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32893 states to 32893 states and 135394 transitions. [2022-03-01 15:47:43,254 INFO L78 Accepts]: Start accepts. Automaton has 32893 states and 135394 transitions. Word has length 170 [2022-03-01 15:47:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:43,254 INFO L470 AbstractCegarLoop]: Abstraction has 32893 states and 135394 transitions. [2022-03-01 15:47:43,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 32893 states and 135394 transitions. [2022-03-01 15:47:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:43,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:43,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:43,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:43,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:43,544 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -13807195, now seen corresponding path program 23 times [2022-03-01 15:47:43,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:43,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654486281] [2022-03-01 15:47:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:43,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:43,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654486281] [2022-03-01 15:47:43,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654486281] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:43,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132056564] [2022-03-01 15:47:43,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:47:43,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:43,848 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:43,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-01 15:47:44,082 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:47:44,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:44,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-01 15:47:44,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:44,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:44,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:44,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:44,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:47:44,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:47:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:44,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:45,017 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2507 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2507 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-01 15:47:45,027 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2507 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2507 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:45,048 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2506) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2506) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2507) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:45,055 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:45,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 97 [2022-03-01 15:47:45,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-03-01 15:47:45,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-03-01 15:47:45,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:45,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:45,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:45,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:47:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:45,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132056564] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:45,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:45,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 43 [2022-03-01 15:47:45,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497909455] [2022-03-01 15:47:45,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:45,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-01 15:47:45,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:45,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-01 15:47:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1419, Unknown=3, NotChecked=234, Total=1806 [2022-03-01 15:47:45,476 INFO L87 Difference]: Start difference. First operand 32893 states and 135394 transitions. Second operand has 43 states, 43 states have (on average 6.1395348837209305) internal successors, (264), 43 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:47,265 INFO L93 Difference]: Finished difference Result 62039 states and 260072 transitions. [2022-03-01 15:47:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 15:47:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.1395348837209305) internal successors, (264), 43 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:47,509 INFO L225 Difference]: With dead ends: 62039 [2022-03-01 15:47:47,509 INFO L226 Difference]: Without dead ends: 58418 [2022-03-01 15:47:47,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=551, Invalid=2998, Unknown=3, NotChecked=354, Total=3906 [2022-03-01 15:47:47,510 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 997 mSDsluCounter, 5457 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 5122 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1102 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:47,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 5122 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1932 Invalid, 0 Unknown, 1102 Unchecked, 0.6s Time] [2022-03-01 15:47:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58418 states. [2022-03-01 15:47:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58418 to 33053. [2022-03-01 15:47:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33053 states, 33052 states have (on average 4.1215660171850415) internal successors, (136226), 33052 states have internal predecessors, (136226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33053 states to 33053 states and 136226 transitions. [2022-03-01 15:47:48,888 INFO L78 Accepts]: Start accepts. Automaton has 33053 states and 136226 transitions. Word has length 170 [2022-03-01 15:47:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:48,888 INFO L470 AbstractCegarLoop]: Abstraction has 33053 states and 136226 transitions. [2022-03-01 15:47:48,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.1395348837209305) internal successors, (264), 43 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33053 states and 136226 transitions. [2022-03-01 15:47:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:48,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:48,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:48,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:49,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-01 15:47:49,184 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1368426203, now seen corresponding path program 19 times [2022-03-01 15:47:49,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:49,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797165597] [2022-03-01 15:47:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:49,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:49,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797165597] [2022-03-01 15:47:49,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797165597] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:49,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368654777] [2022-03-01 15:47:49,491 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:47:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:49,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:49,493 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:49,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-01 15:47:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:49,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-01 15:47:49,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:49,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:47:50,013 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:47:50,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:47:50,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:50,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:50,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:47:50,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:47:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:47:50,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:50,956 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2558 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2558 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-01 15:47:50,965 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2558 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2558 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:51,011 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2557 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2557) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2557 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2557) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2558) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:47:51,020 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:51,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 101 [2022-03-01 15:47:51,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2022-03-01 15:47:51,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-03-01 15:47:51,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:51,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:51,114 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-01 15:47:51,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-01 15:47:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:51,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368654777] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:51,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:51,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 47 [2022-03-01 15:47:51,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253987529] [2022-03-01 15:47:51,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:51,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-01 15:47:51,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-01 15:47:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1749, Unknown=3, NotChecked=258, Total=2162 [2022-03-01 15:47:51,839 INFO L87 Difference]: Start difference. First operand 33053 states and 136226 transitions. Second operand has 47 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:47:54,454 INFO L93 Difference]: Finished difference Result 58119 states and 244852 transitions. [2022-03-01 15:47:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 15:47:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:47:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:47:54,838 INFO L225 Difference]: With dead ends: 58119 [2022-03-01 15:47:54,838 INFO L226 Difference]: Without dead ends: 54798 [2022-03-01 15:47:54,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 311 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=579, Invalid=4542, Unknown=3, NotChecked=426, Total=5550 [2022-03-01 15:47:54,839 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1364 mSDsluCounter, 6823 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 6174 SdHoareTripleChecker+Invalid, 4208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2012 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:47:54,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1364 Valid, 6174 Invalid, 4208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2136 Invalid, 0 Unknown, 2012 Unchecked, 1.0s Time] [2022-03-01 15:47:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54798 states. [2022-03-01 15:47:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54798 to 32965. [2022-03-01 15:47:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32965 states, 32964 states have (on average 4.112607693241111) internal successors, (135568), 32964 states have internal predecessors, (135568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32965 states to 32965 states and 135568 transitions. [2022-03-01 15:47:55,996 INFO L78 Accepts]: Start accepts. Automaton has 32965 states and 135568 transitions. Word has length 170 [2022-03-01 15:47:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:47:55,997 INFO L470 AbstractCegarLoop]: Abstraction has 32965 states and 135568 transitions. [2022-03-01 15:47:55,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:47:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32965 states and 135568 transitions. [2022-03-01 15:47:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:47:56,078 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:47:56,078 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:47:56,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-01 15:47:56,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-01 15:47:56,297 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:47:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:47:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1160771103, now seen corresponding path program 20 times [2022-03-01 15:47:56,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:47:56,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837090663] [2022-03-01 15:47:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:47:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:47:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:47:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:47:56,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:47:56,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837090663] [2022-03-01 15:47:56,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837090663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:47:56,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97116301] [2022-03-01 15:47:56,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:47:56,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:47:56,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:47:56,871 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:47:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-01 15:47:57,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:47:57,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:47:57,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-01 15:47:57,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:47:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:57,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:57,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:57,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:47:57,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:47:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:47:57,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:47:57,934 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2608 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2608) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2608 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2608) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-03-01 15:47:57,956 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2607 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2607) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2608) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2608 (Array Int Int)) (v_ArrVal_2607 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2607) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2608) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:47:57,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:47:57,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 186 [2022-03-01 15:47:57,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 154 [2022-03-01 15:47:57,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-03-01 15:47:58,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:58,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:47:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:47:58,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:47:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:47:58,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97116301] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:47:58,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:47:58,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 26] total 57 [2022-03-01 15:47:58,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795725239] [2022-03-01 15:47:58,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:47:58,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-01 15:47:58,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:47:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-01 15:47:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2714, Unknown=2, NotChecked=214, Total=3192 [2022-03-01 15:47:58,761 INFO L87 Difference]: Start difference. First operand 32965 states and 135568 transitions. Second operand has 57 states, 57 states have (on average 4.964912280701754) internal successors, (283), 57 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:02,696 INFO L93 Difference]: Finished difference Result 104797 states and 440177 transitions. [2022-03-01 15:48:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-01 15:48:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.964912280701754) internal successors, (283), 57 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:03,156 INFO L225 Difference]: With dead ends: 104797 [2022-03-01 15:48:03,156 INFO L226 Difference]: Without dead ends: 98155 [2022-03-01 15:48:03,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 300 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1561, Invalid=8747, Unknown=2, NotChecked=402, Total=10712 [2022-03-01 15:48:03,157 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 3210 mSDsluCounter, 7011 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3210 SdHoareTripleChecker+Valid, 6366 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 579 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:03,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3210 Valid, 6366 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2898 Invalid, 0 Unknown, 579 Unchecked, 1.1s Time] [2022-03-01 15:48:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98155 states. [2022-03-01 15:48:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98155 to 33073. [2022-03-01 15:48:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33073 states, 33072 states have (on average 4.1137215771649736) internal successors, (136049), 33072 states have internal predecessors, (136049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33073 states to 33073 states and 136049 transitions. [2022-03-01 15:48:05,021 INFO L78 Accepts]: Start accepts. Automaton has 33073 states and 136049 transitions. Word has length 170 [2022-03-01 15:48:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:05,021 INFO L470 AbstractCegarLoop]: Abstraction has 33073 states and 136049 transitions. [2022-03-01 15:48:05,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.964912280701754) internal successors, (283), 57 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33073 states and 136049 transitions. [2022-03-01 15:48:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:05,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:05,102 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:05,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-01 15:48:05,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-01 15:48:05,320 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1715746321, now seen corresponding path program 21 times [2022-03-01 15:48:05,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:05,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399803151] [2022-03-01 15:48:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:05,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:05,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399803151] [2022-03-01 15:48:05,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399803151] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:05,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174562608] [2022-03-01 15:48:05,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:48:05,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:05,631 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:05,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-01 15:48:05,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-01 15:48:05,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:48:05,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 89 conjunts are in the unsatisfiable core [2022-03-01 15:48:05,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:06,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:48:06,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:06,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-03-01 15:48:06,686 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:48:06,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:48:06,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:06,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-01 15:48:06,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-01 15:48:07,049 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:07,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-01 15:48:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:07,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:07,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_3~0_264 Int)) (or (not (<= v_~i_3~0_264 (+ c_~i_3~0 1))) (and (forall ((v_ArrVal_2660 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2660) c_~X_0~0.base) (+ c_~X_0~0.offset (* v_~i_3~0_264 4))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0))) (forall ((v_ArrVal_2660 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2660) c_~X_0~0.base) (+ c_~X_0~0.offset (* v_~i_3~0_264 4))) 1 c_~s_2~0)))) (< v_~i_3~0_264 c_~n_1~0))) is different from false [2022-03-01 15:48:07,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_3~0_264 Int)) (or (not (<= v_~i_3~0_264 (+ c_~i_3~0 1))) (< v_~i_3~0_264 c_~n_1~0) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2659) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2660) c_~X_0~0.base) (+ c_~X_0~0.offset (* v_~i_3~0_264 4))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2659) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2660) c_~X_0~0.base) (+ c_~X_0~0.offset (* v_~i_3~0_264 4))) 1 c_~s_2~0)))))) is different from false [2022-03-01 15:48:07,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:07,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 261 [2022-03-01 15:48:07,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 231 [2022-03-01 15:48:07,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 225 [2022-03-01 15:48:07,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 213 [2022-03-01 15:48:07,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 189 [2022-03-01 15:48:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:10,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174562608] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:48:10,258 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:48:10,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28, 26] total 61 [2022-03-01 15:48:10,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236408603] [2022-03-01 15:48:10,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:48:10,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-01 15:48:10,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:48:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-01 15:48:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3155, Unknown=2, NotChecked=230, Total=3660 [2022-03-01 15:48:10,260 INFO L87 Difference]: Start difference. First operand 33073 states and 136049 transitions. Second operand has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 61 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:17,484 INFO L93 Difference]: Finished difference Result 124642 states and 519454 transitions. [2022-03-01 15:48:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-01 15:48:17,484 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 61 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:18,628 INFO L225 Difference]: With dead ends: 124642 [2022-03-01 15:48:18,628 INFO L226 Difference]: Without dead ends: 118606 [2022-03-01 15:48:18,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 308 SyntacticMatches, 18 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 5825 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1913, Invalid=16453, Unknown=2, NotChecked=538, Total=18906 [2022-03-01 15:48:18,629 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 3401 mSDsluCounter, 9501 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 8443 SdHoareTripleChecker+Invalid, 6589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3504 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:18,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3401 Valid, 8443 Invalid, 6589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2951 Invalid, 0 Unknown, 3504 Unchecked, 1.3s Time] [2022-03-01 15:48:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118606 states. [2022-03-01 15:48:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118606 to 32745. [2022-03-01 15:48:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32745 states, 32744 states have (on average 4.111379183972637) internal successors, (134623), 32744 states have internal predecessors, (134623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32745 states to 32745 states and 134623 transitions. [2022-03-01 15:48:20,610 INFO L78 Accepts]: Start accepts. Automaton has 32745 states and 134623 transitions. Word has length 170 [2022-03-01 15:48:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:20,610 INFO L470 AbstractCegarLoop]: Abstraction has 32745 states and 134623 transitions. [2022-03-01 15:48:20,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 61 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32745 states and 134623 transitions. [2022-03-01 15:48:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:20,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:20,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:20,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-01 15:48:20,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-01 15:48:20,904 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 289541483, now seen corresponding path program 24 times [2022-03-01 15:48:20,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:20,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558410124] [2022-03-01 15:48:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:21,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:21,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558410124] [2022-03-01 15:48:21,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558410124] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:21,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532833969] [2022-03-01 15:48:21,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:48:21,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:21,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:21,193 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-01 15:48:21,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:48:21,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:48:21,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-01 15:48:21,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:21,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:48:22,059 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:48:22,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:48:22,069 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:48:22,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:48:22,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:48:22,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:22,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-03-01 15:48:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:22,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:23,584 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:23,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 81 [2022-03-01 15:48:23,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-03-01 15:48:23,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-03-01 15:48:24,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-01 15:48:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:24,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532833969] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:48:24,923 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:48:24,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27, 26] total 60 [2022-03-01 15:48:24,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187152223] [2022-03-01 15:48:24,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:48:24,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-01 15:48:24,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:48:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-01 15:48:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3223, Unknown=20, NotChecked=0, Total=3540 [2022-03-01 15:48:24,924 INFO L87 Difference]: Start difference. First operand 32745 states and 134623 transitions. Second operand has 60 states, 60 states have (on average 5.416666666666667) internal successors, (325), 60 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:29,174 INFO L93 Difference]: Finished difference Result 67421 states and 282489 transitions. [2022-03-01 15:48:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-01 15:48:29,175 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 5.416666666666667) internal successors, (325), 60 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:29,556 INFO L225 Difference]: With dead ends: 67421 [2022-03-01 15:48:29,557 INFO L226 Difference]: Without dead ends: 63800 [2022-03-01 15:48:29,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1895, Invalid=10075, Unknown=20, NotChecked=0, Total=11990 [2022-03-01 15:48:29,558 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 2893 mSDsluCounter, 9343 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2893 SdHoareTripleChecker+Valid, 8447 SdHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1647 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:29,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2893 Valid, 8447 Invalid, 5068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 3274 Invalid, 0 Unknown, 1647 Unchecked, 1.2s Time] [2022-03-01 15:48:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63800 states. [2022-03-01 15:48:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63800 to 33937. [2022-03-01 15:48:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33937 states, 33936 states have (on average 4.125559877416313) internal successors, (140005), 33936 states have internal predecessors, (140005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33937 states to 33937 states and 140005 transitions. [2022-03-01 15:48:31,047 INFO L78 Accepts]: Start accepts. Automaton has 33937 states and 140005 transitions. Word has length 170 [2022-03-01 15:48:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:31,048 INFO L470 AbstractCegarLoop]: Abstraction has 33937 states and 140005 transitions. [2022-03-01 15:48:31,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 5.416666666666667) internal successors, (325), 60 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33937 states and 140005 transitions. [2022-03-01 15:48:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:31,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:31,134 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:31,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-01 15:48:31,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-01 15:48:31,348 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1065077525, now seen corresponding path program 22 times [2022-03-01 15:48:31,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:31,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815842779] [2022-03-01 15:48:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:31,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:31,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815842779] [2022-03-01 15:48:31,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815842779] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:31,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502636322] [2022-03-01 15:48:31,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:48:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:31,867 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:31,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-01 15:48:32,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:48:32,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:48:32,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-01 15:48:32,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:32,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:48:32,344 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 15:48:32,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-01 15:48:32,374 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:48:32,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:48:32,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-01 15:48:32,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-01 15:48:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:48:32,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:32,976 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2762 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2762) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_2762 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2762) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:48:33,127 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2762 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2762) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2762 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2762) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:48:33,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:33,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:48:33,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:48:33,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:48:33,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:33,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:48:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:33,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502636322] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:48:33,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:48:33,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 17] total 48 [2022-03-01 15:48:33,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257065043] [2022-03-01 15:48:33,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:48:33,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-01 15:48:33,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:48:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-01 15:48:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1928, Unknown=2, NotChecked=178, Total=2256 [2022-03-01 15:48:33,487 INFO L87 Difference]: Start difference. First operand 33937 states and 140005 transitions. Second operand has 48 states, 48 states have (on average 6.770833333333333) internal successors, (325), 48 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:36,781 INFO L93 Difference]: Finished difference Result 59565 states and 251031 transitions. [2022-03-01 15:48:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 15:48:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 6.770833333333333) internal successors, (325), 48 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:37,152 INFO L225 Difference]: With dead ends: 59565 [2022-03-01 15:48:37,153 INFO L226 Difference]: Without dead ends: 56244 [2022-03-01 15:48:37,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 315 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=804, Invalid=5364, Unknown=2, NotChecked=310, Total=6480 [2022-03-01 15:48:37,153 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1667 mSDsluCounter, 6780 mSDsCounter, 0 mSdLazyCounter, 3118 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 849 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:37,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1667 Valid, 6091 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3118 Invalid, 0 Unknown, 849 Unchecked, 1.1s Time] [2022-03-01 15:48:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56244 states. [2022-03-01 15:48:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56244 to 35912. [2022-03-01 15:48:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35912 states, 35911 states have (on average 4.146194759265963) internal successors, (148894), 35911 states have internal predecessors, (148894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 148894 transitions. [2022-03-01 15:48:38,271 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 148894 transitions. Word has length 170 [2022-03-01 15:48:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:38,272 INFO L470 AbstractCegarLoop]: Abstraction has 35912 states and 148894 transitions. [2022-03-01 15:48:38,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.770833333333333) internal successors, (325), 48 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 148894 transitions. [2022-03-01 15:48:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:38,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:38,361 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:38,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-01 15:48:38,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-01 15:48:38,579 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1708266603, now seen corresponding path program 25 times [2022-03-01 15:48:38,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:38,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445351652] [2022-03-01 15:48:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:39,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:39,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445351652] [2022-03-01 15:48:39,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445351652] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:39,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269652201] [2022-03-01 15:48:39,119 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:48:39,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:39,120 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:39,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-01 15:48:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:39,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-01 15:48:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:39,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:48:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:39,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-03-01 15:48:39,802 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:48:39,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:48:40,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:48:40,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:48:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:40,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:40,510 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2813 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2813) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0))) (forall ((v_ArrVal_2813 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2813) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0)))) is different from false [2022-03-01 15:48:40,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:40,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:48:40,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:48:40,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:48:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:40,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:48:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:43,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269652201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:48:43,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:48:43,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 22] total 50 [2022-03-01 15:48:43,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880208678] [2022-03-01 15:48:43,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:48:43,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-01 15:48:43,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:48:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-01 15:48:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2171, Unknown=2, NotChecked=94, Total=2450 [2022-03-01 15:48:43,478 INFO L87 Difference]: Start difference. First operand 35912 states and 148894 transitions. Second operand has 50 states, 50 states have (on average 5.88) internal successors, (294), 50 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:46,204 INFO L93 Difference]: Finished difference Result 56418 states and 236239 transitions. [2022-03-01 15:48:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 15:48:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.88) internal successors, (294), 50 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:46,506 INFO L225 Difference]: With dead ends: 56418 [2022-03-01 15:48:46,507 INFO L226 Difference]: Without dead ends: 53037 [2022-03-01 15:48:46,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 305 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=700, Invalid=5944, Unknown=2, NotChecked=160, Total=6806 [2022-03-01 15:48:46,507 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1408 mSDsluCounter, 7344 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 6641 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 934 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:46,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1408 Valid, 6641 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2345 Invalid, 0 Unknown, 934 Unchecked, 1.0s Time] [2022-03-01 15:48:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53037 states. [2022-03-01 15:48:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53037 to 36032. [2022-03-01 15:48:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36032 states, 36031 states have (on average 4.146873525575199) internal successors, (149416), 36031 states have internal predecessors, (149416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36032 states to 36032 states and 149416 transitions. [2022-03-01 15:48:47,823 INFO L78 Accepts]: Start accepts. Automaton has 36032 states and 149416 transitions. Word has length 170 [2022-03-01 15:48:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:47,823 INFO L470 AbstractCegarLoop]: Abstraction has 36032 states and 149416 transitions. [2022-03-01 15:48:47,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.88) internal successors, (294), 50 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 36032 states and 149416 transitions. [2022-03-01 15:48:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:48,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:48,172 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:48,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-01 15:48:48,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:48,390 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -462566953, now seen corresponding path program 26 times [2022-03-01 15:48:48,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:48,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600665783] [2022-03-01 15:48:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:48,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:48,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600665783] [2022-03-01 15:48:48,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600665783] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:48,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658509357] [2022-03-01 15:48:48,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:48:48,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:48,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:48,694 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:48,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-01 15:48:48,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:48:48,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:48:48,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-01 15:48:48,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:48,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:48:49,315 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:48:49,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:48:49,324 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:48:49,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:48:49,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:48:49,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-01 15:48:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:49,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:50,021 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2864 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2864) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2864 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2864) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-01 15:48:50,045 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:50,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-01 15:48:50,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-01 15:48:50,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:48:50,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:50,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-01 15:48:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:48:50,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658509357] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:48:50,676 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:48:50,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 49 [2022-03-01 15:48:50,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057007396] [2022-03-01 15:48:50,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:48:50,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-01 15:48:50,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:48:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-01 15:48:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2054, Unknown=1, NotChecked=92, Total=2352 [2022-03-01 15:48:50,677 INFO L87 Difference]: Start difference. First operand 36032 states and 149416 transitions. Second operand has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:48:55,083 INFO L93 Difference]: Finished difference Result 111853 states and 470186 transitions. [2022-03-01 15:48:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:48:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:48:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:48:55,627 INFO L225 Difference]: With dead ends: 111853 [2022-03-01 15:48:55,627 INFO L226 Difference]: Without dead ends: 104732 [2022-03-01 15:48:55,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 309 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1395, Invalid=7724, Unknown=5, NotChecked=188, Total=9312 [2022-03-01 15:48:55,628 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 2123 mSDsluCounter, 7999 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 7212 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:48:55,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2123 Valid, 7212 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2992 Invalid, 0 Unknown, 456 Unchecked, 1.3s Time] [2022-03-01 15:48:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104732 states. [2022-03-01 15:48:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104732 to 35736. [2022-03-01 15:48:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35736 states, 35735 states have (on average 4.14590737372324) internal successors, (148154), 35735 states have internal predecessors, (148154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35736 states to 35736 states and 148154 transitions. [2022-03-01 15:48:57,644 INFO L78 Accepts]: Start accepts. Automaton has 35736 states and 148154 transitions. Word has length 170 [2022-03-01 15:48:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:48:57,644 INFO L470 AbstractCegarLoop]: Abstraction has 35736 states and 148154 transitions. [2022-03-01 15:48:57,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:48:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35736 states and 148154 transitions. [2022-03-01 15:48:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:48:57,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:48:57,730 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:48:57,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-01 15:48:57,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:57,946 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:48:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:48:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -857422425, now seen corresponding path program 23 times [2022-03-01 15:48:57,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:48:57,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291494476] [2022-03-01 15:48:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:48:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:48:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:48:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:48:58,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:48:58,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291494476] [2022-03-01 15:48:58,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291494476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:48:58,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176041722] [2022-03-01 15:48:58,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:48:58,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:48:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:48:58,504 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:48:58,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-01 15:48:58,703 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:48:58,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:48:58,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-01 15:48:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:48:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:59,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-01 15:48:59,215 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:59,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-01 15:48:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:48:59,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:48:59,726 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:48:59,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-01 15:48:59,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-01 15:48:59,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:48:59,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:48:59,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-01 15:49:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:49:00,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176041722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:49:00,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:49:00,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 45 [2022-03-01 15:49:00,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361182546] [2022-03-01 15:49:00,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:49:00,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-01 15:49:00,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:49:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-01 15:49:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1809, Unknown=4, NotChecked=0, Total=1980 [2022-03-01 15:49:00,050 INFO L87 Difference]: Start difference. First operand 35736 states and 148154 transitions. Second operand has 45 states, 45 states have (on average 6.333333333333333) internal successors, (285), 45 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:49:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:49:03,287 INFO L93 Difference]: Finished difference Result 78614 states and 330822 transitions. [2022-03-01 15:49:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-01 15:49:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.333333333333333) internal successors, (285), 45 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-03-01 15:49:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:49:03,620 INFO L225 Difference]: With dead ends: 78614 [2022-03-01 15:49:03,620 INFO L226 Difference]: Without dead ends: 73748 [2022-03-01 15:49:03,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 316 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=958, Invalid=5680, Unknown=4, NotChecked=0, Total=6642 [2022-03-01 15:49:03,621 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 1601 mSDsluCounter, 7429 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 6924 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:49:03,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1601 Valid, 6924 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2334 Invalid, 0 Unknown, 388 Unchecked, 0.9s Time] [2022-03-01 15:49:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73748 states. [2022-03-01 15:49:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73748 to 36654. [2022-03-01 15:49:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36654 states, 36653 states have (on average 4.147464054784056) internal successors, (152017), 36653 states have internal predecessors, (152017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:49:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36654 states to 36654 states and 152017 transitions. [2022-03-01 15:49:05,207 INFO L78 Accepts]: Start accepts. Automaton has 36654 states and 152017 transitions. Word has length 170 [2022-03-01 15:49:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:49:05,207 INFO L470 AbstractCegarLoop]: Abstraction has 36654 states and 152017 transitions. [2022-03-01 15:49:05,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.333333333333333) internal successors, (285), 45 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:49:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 36654 states and 152017 transitions. [2022-03-01 15:49:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-01 15:49:05,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:49:05,302 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:49:05,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-01 15:49:05,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:49:05,512 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 15:49:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:49:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -903759815, now seen corresponding path program 24 times [2022-03-01 15:49:05,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:49:05,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860317398] [2022-03-01 15:49:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:49:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:49:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:49:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:49:05,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:49:05,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860317398] [2022-03-01 15:49:05,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860317398] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:49:05,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958960206] [2022-03-01 15:49:05,762 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:49:05,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:49:05,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:49:05,763 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:49:05,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-01 15:49:06,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:49:06,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:49:06,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 97 conjunts are in the unsatisfiable core [2022-03-01 15:49:06,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:49:06,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:49:06,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 15:49:07,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:49:07,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:49:07,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-03-01 15:49:07,321 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:49:07,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:49:07,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:49:07,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:49:07,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:49:07,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 15:49:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:49:07,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:49:08,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array Int Int))) (let ((.cse0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (or (not (<= .cse0 2147483647)) (and (< .cse0 (+ c_~s_6~0 c_~t_8~0 1)) (<= (+ c_~s_6~0 c_~t_8~0) .cse0))))) is different from false [2022-03-01 15:49:08,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array Int Int))) (let ((.cse0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (or (not (<= .cse0 2147483647)) (let ((.cse1 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (<= (+ c_~s_6~0 .cse1) .cse0) (< .cse0 (+ c_~s_6~0 .cse1 1))))))) is different from false [2022-03-01 15:49:08,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2968))) (let ((.cse0 (+ (select (select (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (or (let ((.cse1 (select (select .cse2 c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (< .cse0 (+ c_~s_6~0 .cse1 1)) (<= (+ c_~s_6~0 .cse1) .cse0))) (not (<= .cse0 2147483647)))))) is different from false [2022-03-01 15:49:08,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2968))) (let ((.cse0 (select (select (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (or (let ((.cse1 (select (select .cse2 c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (< .cse0 (+ c_~s_6~0 .cse1 1)) (<= (+ c_~s_6~0 .cse1) .cse0))) (not (<= .cse0 2147483647)))))) is different from false [2022-03-01 15:49:08,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2968)) (.cse3 (+ c_~X_0~0.offset 4))) (let ((.cse1 (select (select (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) .cse3))) (or (let ((.cse0 (select (select .cse2 c_~X_0~0.base) .cse3))) (and (<= .cse0 .cse1) (< .cse1 (+ .cse0 1)))) (not (<= .cse1 2147483647)))))) is different from false [2022-03-01 15:49:08,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2967) |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2968)) (.cse3 (+ c_~X_0~0.offset 4))) (let ((.cse1 (select (select (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2969) c_~X_0~0.base) .cse3))) (or (let ((.cse0 (select (select .cse2 c_~X_0~0.base) .cse3))) (and (<= .cse0 .cse1) (< .cse1 (+ .cse0 1)))) (not (<= .cse1 2147483647)))))) is different from false [2022-03-01 15:49:12,318 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:49:12,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 110 [2022-03-01 15:49:12,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42316 treesize of output 40180 [2022-03-01 15:49:13,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38516 treesize of output 34356 [2022-03-01 15:49:13,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34356 treesize of output 32932 [2022-03-01 15:49:13,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32932 treesize of output 28708 [2022-03-01 15:49:13,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28708 treesize of output 26116 [2022-03-01 15:49:14,017 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-01 15:49:14,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-01 15:49:14,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-01 15:49:14,232 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-01 15:49:14,235 INFO L158 Benchmark]: Toolchain (without parser) took 393706.57ms. Allocated memory was 191.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 134.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.36ms. Allocated memory is still 191.9MB. Free memory was 164.5MB in the beginning and 160.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.34ms. Allocated memory is still 191.9MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 191.9MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: RCFGBuilder took 585.66ms. Allocated memory is still 191.9MB. Free memory was 155.9MB in the beginning and 120.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-03-01 15:49:14,235 INFO L158 Benchmark]: TraceAbstraction took 392759.83ms. Allocated memory was 191.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-03-01 15:49:14,236 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.10ms. Allocated memory is still 191.9MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.36ms. Allocated memory is still 191.9MB. Free memory was 164.5MB in the beginning and 160.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.34ms. Allocated memory is still 191.9MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 191.9MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 585.66ms. Allocated memory is still 191.9MB. Free memory was 155.9MB in the beginning and 120.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 392759.83ms. Allocated memory was 191.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-01 15:49:14,262 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...